Base | Representation |
---|---|
bin | 11101010010000000100… |
… | …010011011000101010011 |
3 | 21010100211202120010120120 |
4 | 131102000202123011103 |
5 | 230431442001431003 |
6 | 4140220435041323 |
7 | 265243136003406 |
oct | 35220042330523 |
9 | 7110752503516 |
10 | 2012201202003 |
11 | 706408136503 |
12 | 285b8a140243 |
13 | 1179992b4325 |
14 | 6d5690c3d3d |
15 | 3751e243853 |
hex | 1d48089b153 |
2012201202003 has 8 divisors (see below), whose sum is σ = 2685709433088. Its totient is φ = 1340080219464.
The previous prime is 2012201201893. The next prime is 2012201202019. The reversal of 2012201202003 is 3002021022102.
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 2012201202003 - 222 = 2012197007699 is a prime.
It is a super-2 number, since 2×20122012020032 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2012201202023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 346808751 + ... + 346814552.
It is an arithmetic number, because the mean of its divisors is an integer number (335713679136).
Almost surely, 22012201202003 is an apocalyptic number.
2012201202003 is a deficient number, since it is larger than the sum of its proper divisors (673508231085).
2012201202003 is an equidigital number, since it uses as much as digits as its factorization.
2012201202003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 693624273.
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 2012201202003 its reverse (3002021022102), we get a palindrome (5014222224105).
The spelling of 2012201202003 in words is "two trillion, twelve billion, two hundred one million, two hundred two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •