Base | Representation |
---|---|
bin | 100001100111010110110… |
… | …110010100000011101111 |
3 | 22011211112000022010110202 |
4 | 201213112312110003233 |
5 | 300321341003000421 |
6 | 4525111131424115 |
7 | 325615001012531 |
oct | 41472666240357 |
9 | 8154460263422 |
10 | 2310002000111 |
11 | 8107369a8883 |
12 | 31383abb503b |
13 | 139aa8600930 |
14 | 7db3a115851 |
15 | 4014d7e210b |
hex | 219d6d940ef |
2310002000111 has 8 divisors (see below), whose sum is σ = 2487728259744. Its totient is φ = 2132280568800.
The previous prime is 2310002000069. The next prime is 2310002000171. The reversal of 2310002000111 is 1110002000132.
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 2310002000111 - 226 = 2309934891247 is a prime.
It is a super-2 number, since 2×23100020001112 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2310002000092 and 2310002000101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2310002000171) 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, 181115 + ... + 2157036.
It is an arithmetic number, because the mean of its divisors is an integer number (310966032468).
Almost surely, 22310002000111 is an apocalyptic number.
2310002000111 is a deficient number, since it is larger than the sum of its proper divisors (177726259633).
2310002000111 is a wasteful number, since it uses less digits than its factorization.
2310002000111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2414161.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 2310002000111 its reverse (1110002000132), we get a palindrome (3420004000243).
The spelling of 2310002000111 in words is "two trillion, three hundred ten billion, two million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •