Base | Representation |
---|---|
bin | 100000000001000001010… |
… | …111110010110011110111 |
3 | 21210022220010221210000020 |
4 | 200001001113302303313 |
5 | 242021321210341043 |
6 | 4402415435220223 |
7 | 314645011353243 |
oct | 40010127626367 |
9 | 7708803853006 |
10 | 2200120012023 |
11 | 77907a43187a |
12 | 2b64938a7673 |
13 | 12c6166b2a7b |
14 | 786b4891423 |
15 | 3c36bc5ae83 |
hex | 200415f2cf7 |
2200120012023 has 8 divisors (see below), whose sum is σ = 2938027344768. Its totient is φ = 1464479676984.
The previous prime is 2200120012003. The next prime is 2200120012061. The reversal of 2200120012023 is 3202100210022.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2200120012023 - 228 = 2199851576567 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2200120011993 and 2200120012011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200120012003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 566747161 + ... + 566751042.
It is an arithmetic number, because the mean of its divisors is an integer number (367253418096).
Almost surely, 22200120012023 is an apocalyptic number.
2200120012023 is a deficient number, since it is larger than the sum of its proper divisors (737907332745).
2200120012023 is a wasteful number, since it uses less digits than its factorization.
2200120012023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1133498853.
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 2200120012023 its reverse (3202100210022), we get a palindrome (5402220222045).
The spelling of 2200120012023 in words is "two trillion, two hundred billion, one hundred twenty million, twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •