Base | Representation |
---|---|
bin | 1001000110101010111001… |
… | …1110110001001011011101 |
3 | 1022102222002010101212200201 |
4 | 2101222232132301023131 |
5 | 2303001342440213041 |
6 | 33142342314023501 |
7 | 2052133054310512 |
oct | 221525636611335 |
9 | 38388063355621 |
10 | 10010201101021 |
11 | 320a336613220 |
12 | 1158064117b91 |
13 | 577c5b6c7184 |
14 | 2686d3c7d309 |
15 | 1255c57c6631 |
hex | 91aae7b12dd |
10010201101021 has 16 divisors (see below), whose sum is σ = 11398541420160. Its totient is φ = 8701826253120.
The previous prime is 10010201101007. The next prime is 10010201101031. The reversal of 10010201101021 is 12010110201001.
It is not a de Polignac number, because 10010201101021 - 29 = 10010201100509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10010201100989 and 10010201101007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10010201101031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5309730 + ... + 6943603.
It is an arithmetic number, because the mean of its divisors is an integer number (712408838760).
Almost surely, 210010201101021 is an apocalyptic number.
10010201101021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10010201101021 is a deficient number, since it is larger than the sum of its proper divisors (1388340319139).
10010201101021 is a wasteful number, since it uses less digits than its factorization.
10010201101021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12256596.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10010201101021 its reverse (12010110201001), we get a palindrome (22020311302022).
The spelling of 10010201101021 in words is "ten trillion, ten billion, two hundred one million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •