Base | Representation |
---|---|
bin | 1000101000010111… |
… | …1100001011010101 |
3 | 12222110111021222101 |
4 | 2022011330023111 |
5 | 14221101004023 |
6 | 1021521202101 |
7 | 111261404614 |
oct | 21205741325 |
9 | 5873437871 |
10 | 2316813013 |
11 | a898649a9 |
12 | 547a90331 |
13 | 2abcb0a98 |
14 | 17d9a787b |
15 | d85e31ad |
hex | 8a17c2d5 |
2316813013 has 8 divisors (see below), whose sum is σ = 2469622400. Its totient is φ = 2167090848.
The previous prime is 2316812963. The next prime is 2316813019. The reversal of 2316813013 is 3103186132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2316813013 - 213 = 2316804821 is a prime.
It is a super-3 number, since 3×23168130133 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2316813019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 770256 + ... + 773257.
It is an arithmetic number, because the mean of its divisors is an integer number (308702800).
Almost surely, 22316813013 is an apocalyptic number.
It is an amenable number.
2316813013 is a deficient number, since it is larger than the sum of its proper divisors (152809387).
2316813013 is a wasteful number, since it uses less digits than its factorization.
2316813013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1543611.
The product of its (nonzero) digits is 2592, while the sum is 28.
The square root of 2316813013 is about 48133.2838376938. The cubic root of 2316813013 is about 1323.2147335306.
Adding to 2316813013 its reverse (3103186132), we get a palindrome (5419999145).
The spelling of 2316813013 in words is "two billion, three hundred sixteen million, eight hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •