Base | Representation |
---|---|
bin | 111011101010100… |
… | …1000111000101011 |
3 | 12011112011200000211 |
4 | 1313111020320223 |
5 | 13100004430443 |
6 | 530354241551 |
7 | 100416655342 |
oct | 16725107053 |
9 | 5145150024 |
10 | 2002030123 |
11 | 938103955 |
12 | 47a5862b7 |
13 | 25ba08412 |
14 | 14dc66b59 |
15 | bab6419d |
hex | 77548e2b |
2002030123 has 8 divisors (see below), whose sum is σ = 2056148640. Its totient is φ = 1948163520.
The previous prime is 2002030111. The next prime is 2002030157. The reversal of 2002030123 is 3210302002.
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 2002030123 - 29 = 2002029611 is a prime.
It is a super-2 number, since 2×20020301232 = 8016249226798790258, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2002031123) 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, 46815 + ... + 78712.
It is an arithmetic number, because the mean of its divisors is an integer number (257018580).
Almost surely, 22002030123 is an apocalyptic number.
2002030123 is a deficient number, since it is larger than the sum of its proper divisors (54118517).
2002030123 is a wasteful number, since it uses less digits than its factorization.
2002030123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125957.
The product of its (nonzero) digits is 72, while the sum is 13.
The square root of 2002030123 is about 44744.0512582399. The cubic root of 2002030123 is about 1260.3472048531.
Adding to 2002030123 its reverse (3210302002), we get a palindrome (5212332125).
The spelling of 2002030123 in words is "two billion, two million, thirty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •