Base | Representation |
---|---|
bin | 11101001000100001111… |
… | …000000011101000101111 |
3 | 21002101120102200010120200 |
4 | 131020201320003220233 |
5 | 230300120403244043 |
6 | 4131414451044543 |
7 | 264432666411426 |
oct | 35104170035057 |
9 | 7071512603520 |
10 | 2002023103023 |
11 | 702064938059 |
12 | 2840095a0753 |
13 | 116a3673a358 |
14 | 6cc814402bd |
15 | 371259057d3 |
hex | 1d221e03a2f |
2002023103023 has 24 divisors (see below), whose sum is σ = 2935174741200. Its totient is φ = 1314779604864.
The previous prime is 2002023102973. The next prime is 2002023103027. The reversal of 2002023103023 is 3203013202002.
It is a happy number.
It is not a de Polignac number, because 2002023103023 - 210 = 2002023101999 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2002023102987 and 2002023103005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002023103027) 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 23 ways as a sum of consecutive naturals, for example, 4430265 + ... + 4861202.
It is an arithmetic number, because the mean of its divisors is an integer number (122298947550).
Almost surely, 22002023103023 is an apocalyptic number.
2002023103023 is a deficient number, since it is larger than the sum of its proper divisors (933151638177).
2002023103023 is a wasteful number, since it uses less digits than its factorization.
2002023103023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9291831 (or 9291828 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 2002023103023 its reverse (3203013202002), we get a palindrome (5205036305025).
The spelling of 2002023103023 in words is "two trillion, two billion, twenty-three million, one hundred three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •