Base | Representation |
---|---|
bin | 11101000111110001011… |
… | …011001001110111110111 |
3 | 21002022110210002101201220 |
4 | 131013301123021313313 |
5 | 230241434304020043 |
6 | 4131202052121423 |
7 | 264403566130230 |
oct | 35076133116767 |
9 | 7068423071656 |
10 | 2001210220023 |
11 | 701787aa8023 |
12 | 283a21306273 |
13 | 1169371c65b1 |
14 | 6cc054c0087 |
15 | 370c9386483 |
hex | 1d1f16c9df7 |
2001210220023 has 48 divisors (see below), whose sum is σ = 3228166609920. Its totient is φ = 1079982775872.
The previous prime is 2001210219991. The next prime is 2001210220033. The reversal of 2001210220023 is 3200220121002.
It is a happy number.
It is not a de Polignac number, because 2001210220023 - 25 = 2001210219991 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2001210219984 and 2001210220011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001210220033) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 262536 + ... + 2017757.
It is an arithmetic number, because the mean of its divisors is an integer number (67253471040).
Almost surely, 22001210220023 is an apocalyptic number.
2001210220023 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
2001210220023 is a deficient number, since it is larger than the sum of its proper divisors (1226956389897).
2001210220023 is a wasteful number, since it uses less digits than its factorization.
2001210220023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2280428 (or 2280405 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 2001210220023 its reverse (3200220121002), we get a palindrome (5201430341025).
The spelling of 2001210220023 in words is "two trillion, one billion, two hundred ten million, two hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •