Base | Representation |
---|---|
bin | 1001001101000100010100… |
… | …0001101100010101011101 |
3 | 1022211110202020111021010010 |
4 | 2103101011001230111131 |
5 | 2311301431330133041 |
6 | 33305035450433433 |
7 | 2063103352233525 |
oct | 223210501542535 |
9 | 38743666437103 |
10 | 10120101021021 |
11 | 3251a02217792 |
12 | 1175415432879 |
13 | 585424253034 |
14 | 26db5ba50685 |
15 | 1283a8c00a16 |
hex | 9344506c55d |
10120101021021 has 16 divisors (see below), whose sum is σ = 13545032760000. Its totient is φ = 6720988510848.
The previous prime is 10120101020989. The next prime is 10120101021049. The reversal of 10120101021021 is 12012010102101.
It is not a de Polignac number, because 10120101021021 - 25 = 10120101020989 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10120101020988 and 10120101021006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10120101022021) 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 15 ways as a sum of consecutive naturals, for example, 3508851 + ... + 5705456.
It is an arithmetic number, because the mean of its divisors is an integer number (846564547500).
Almost surely, 210120101021021 is an apocalyptic number.
It is an amenable number.
10120101021021 is a deficient number, since it is larger than the sum of its proper divisors (3424931738979).
10120101021021 is a wasteful number, since it uses less digits than its factorization.
10120101021021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9215708.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10120101021021 its reverse (12012010102101), we get a palindrome (22132111123122).
The spelling of 10120101021021 in words is "ten trillion, one hundred twenty billion, one hundred one million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •