Base | Representation |
---|---|
bin | 10011000000000100… |
… | …00110111011100001 |
3 | 222022221011120110120 |
4 | 21200002012323201 |
5 | 131342440200001 |
6 | 4404124550453 |
7 | 510535630221 |
oct | 114002067341 |
9 | 28287146416 |
10 | 10201100001 |
11 | 4365289464 |
12 | 1b883b2429 |
13 | c6756b361 |
14 | 6cab50081 |
15 | 3ea883236 |
hex | 260086ee1 |
10201100001 has 32 divisors (see below), whose sum is σ = 14701512960. Its totient is φ = 6272496384.
The previous prime is 10201099919. The next prime is 10201100009. The reversal of 10201100001 is 10000110201.
It is not a de Polignac number, because 10201100001 - 210 = 10201098977 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10201100009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1751971 + ... + 1757783.
It is an arithmetic number, because the mean of its divisors is an integer number (459422280).
Almost surely, 210201100001 is an apocalyptic number.
It is an amenable number.
10201100001 is a deficient number, since it is larger than the sum of its proper divisors (4500412959).
10201100001 is a wasteful number, since it uses less digits than its factorization.
10201100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6745.
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 10201100001 its reverse (10000110201), we get a palindrome (20201210202).
It can be divided in two parts, 10201 and 100001, that multiplied together give a palindrome (1020110201).
The spelling of 10201100001 in words is "ten billion, two hundred one million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •