Base | Representation |
---|---|
bin | 1001010001111101000101… |
… | …1010000100111010100101 |
3 | 1100010111110112020220010020 |
4 | 2110133101122010322211 |
5 | 2314140404003231041 |
6 | 33411403011545353 |
7 | 2102135064010206 |
oct | 224372132047245 |
9 | 40114415226106 |
10 | 10204060602021 |
11 | 3284577210660 |
12 | 11897472bb259 |
13 | 5903147c7090 |
14 | 273c4461b5ad |
15 | 12a66eb0d866 |
hex | 947d1684ea5 |
10204060602021 has 32 divisors (see below), whose sum is σ = 16825245319680. Its totient is φ = 5408114558400.
The previous prime is 10204060602007. The next prime is 10204060602053. The reversal of 10204060602021 is 12020606040201.
It is not a de Polignac number, because 10204060602021 - 29 = 10204060601509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10204060601982 and 10204060602000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10204060600021) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 625931035 + ... + 625947336.
It is an arithmetic number, because the mean of its divisors is an integer number (525788916240).
Almost surely, 210204060602021 is an apocalyptic number.
10204060602021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10204060602021 is a deficient number, since it is larger than the sum of its proper divisors (6621184717659).
10204060602021 is a wasteful number, since it uses less digits than its factorization.
10204060602021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1251878417.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 10204060602021 its reverse (12020606040201), we get a palindrome (22224666642222).
The spelling of 10204060602021 in words is "ten trillion, two hundred four billion, sixty million, six hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •