Base | Representation |
---|---|
bin | 100001101001010100101… |
… | …000011101111111101011 |
3 | 22012000222002012110201022 |
4 | 201221110220131333223 |
5 | 300340201222100021 |
6 | 4530100354443055 |
7 | 326021204165423 |
oct | 41512450357753 |
9 | 8160862173638 |
10 | 2312112300011 |
11 | 81161a131388 |
12 | 31412989348b |
13 | 13a0538869b7 |
14 | 7dc9a4c3483 |
15 | 40223be11ab |
hex | 21a54a1dfeb |
2312112300011 has 8 divisors (see below), whose sum is σ = 2458277079984. Its totient is φ = 2167076206080.
The previous prime is 2312112299963. The next prime is 2312112300013. The reversal of 2312112300011 is 1100032112132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2312112300011 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2312112300013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 282167285 + ... + 282175478.
It is an arithmetic number, because the mean of its divisors is an integer number (307284634998).
Almost surely, 22312112300011 is an apocalyptic number.
2312112300011 is a deficient number, since it is larger than the sum of its proper divisors (146164779973).
2312112300011 is a wasteful number, since it uses less digits than its factorization.
2312112300011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 564343021.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 2312112300011 its reverse (1100032112132), we get a palindrome (3412144412143).
The spelling of 2312112300011 in words is "two trillion, three hundred twelve billion, one hundred twelve million, three hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •