Base | Representation |
---|---|
bin | 11101001000100001001… |
… | …110100101000111010101 |
3 | 21002101112200012201201212 |
4 | 131020201032211013111 |
5 | 230300110112330401 |
6 | 4131413422031205 |
7 | 264432505115102 |
oct | 35104116450725 |
9 | 7071480181655 |
10 | 2002012230101 |
11 | 702059791074 |
12 | 284005a18505 |
13 | 116a34401380 |
14 | 6cc7dc0daa9 |
15 | 371249a8dbb |
hex | 1d2213a51d5 |
2002012230101 has 8 divisors (see below), whose sum is σ = 2156059876320. Its totient is φ = 1847971256112.
The previous prime is 2002012230019. The next prime is 2002012230107. The reversal of 2002012230101 is 1010322102002.
It is a happy number.
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 2002012230101 - 218 = 2002011967957 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002012230107) 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, 1035995 + ... + 2253288.
It is an arithmetic number, because the mean of its divisors is an integer number (269507484540).
Almost surely, 22002012230101 is an apocalyptic number.
It is an amenable number.
2002012230101 is a deficient number, since it is larger than the sum of its proper divisors (154047646219).
2002012230101 is a wasteful number, since it uses less digits than its factorization.
2002012230101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3336115.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 2002012230101 its reverse (1010322102002), we get a palindrome (3012334332103).
The spelling of 2002012230101 in words is "two trillion, two billion, twelve million, two hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •