Base | Representation |
---|---|
bin | 11101110001100001011… |
… | …11101011010100011101 |
3 | 10121210121000122122202012 |
4 | 32320300233223110131 |
5 | 113230121111133041 |
6 | 2101545141241005 |
7 | 133624250462645 |
oct | 16706057532435 |
9 | 3553530578665 |
10 | 1023020021021 |
11 | 36495114a459 |
12 | 146327403165 |
13 | 7561654785b |
14 | 3772b867525 |
15 | 1b9276cd3eb |
hex | ee30beb51d |
1023020021021 has 16 divisors (see below), whose sum is σ = 1060819502400. Its totient is φ = 985390156800.
The previous prime is 1023020021003. The next prime is 1023020021081. The reversal of 1023020021021 is 1201200203201.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1023020021021 - 230 = 1021946279197 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1023020020987 and 1023020021005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1023020021081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 47419325 + ... + 47440893.
It is an arithmetic number, because the mean of its divisors is an integer number (66301218900).
Almost surely, 21023020021021 is an apocalyptic number.
It is an amenable number.
1023020021021 is a deficient number, since it is larger than the sum of its proper divisors (37799481379).
1023020021021 is a wasteful number, since it uses less digits than its factorization.
1023020021021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25420.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 1023020021021 its reverse (1201200203201), we get a palindrome (2224220224222).
The spelling of 1023020021021 in words is "one trillion, twenty-three billion, twenty million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •