Base | Representation |
---|---|
bin | 1001000110001000101010… |
… | …1101011001000110101001 |
3 | 1022102002100122122101211000 |
4 | 2101202022231121012221 |
5 | 2302324032310121301 |
6 | 33134222342425213 |
7 | 2051356243024125 |
oct | 221421255310651 |
9 | 38362318571730 |
10 | 10001011020201 |
11 | 320644aaa4503 |
12 | 115631a432209 |
13 | 577125753726 |
14 | 2680a1508585 |
15 | 125238a9e786 |
hex | 9188ab591a9 |
10001011020201 has 16 divisors (see below), whose sum is σ = 14871391862400. Its totient is φ = 6642555022224.
The previous prime is 10001011020167. The next prime is 10001011020263. The reversal of 10001011020201 is 10202011010001.
It is a happy number.
It is not a de Polignac number, because 10001011020201 - 29 = 10001011019689 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (10001011020281) 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, 688483101 + ... + 688497626.
It is an arithmetic number, because the mean of its divisors is an integer number (929461991400).
Almost surely, 210001011020201 is an apocalyptic number.
It is an amenable number.
10001011020201 is a deficient number, since it is larger than the sum of its proper divisors (4870380842199).
10001011020201 is a wasteful number, since it uses less digits than its factorization.
10001011020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1376981005 (or 1376980999 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10001011020201 its reverse (10202011010001), we get a palindrome (20203022030202).
The spelling of 10001011020201 in words is "ten trillion, one billion, eleven million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •