Base | Representation |
---|---|
bin | 1001000110110010000011… |
… | …0111001010110101101001 |
3 | 1022110011000212100010200102 |
4 | 2101230200313022311221 |
5 | 2303014310221201301 |
6 | 33143300544515145 |
7 | 2052231445450352 |
oct | 221544067126551 |
9 | 38404025303612 |
10 | 10012120100201 |
11 | 321013086575a |
12 | 11584ba91bab5 |
13 | 5781a615074b |
14 | 268836a90d29 |
15 | 125688ed8b6b |
hex | 91b20dcad69 |
10012120100201 has 4 divisors (see below), whose sum is σ = 10018342674900. Its totient is φ = 10005897525504.
The previous prime is 10012120100137. The next prime is 10012120100231. The reversal of 10012120100201 is 10200102121001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7942679612176 + 2069440488025 = 2818276^2 + 1438555^2 .
It is a cyclic number.
It is not a de Polignac number, because 10012120100201 - 26 = 10012120100137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10012120100231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3111284936 + ... + 3111288153.
It is an arithmetic number, because the mean of its divisors is an integer number (2504585668725).
Almost surely, 210012120100201 is an apocalyptic number.
It is an amenable number.
10012120100201 is a deficient number, since it is larger than the sum of its proper divisors (6222574699).
10012120100201 is an equidigital number, since it uses as much as digits as its factorization.
10012120100201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6222574698.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10012120100201 its reverse (10200102121001), we get a palindrome (20212222221202).
The spelling of 10012120100201 in words is "ten trillion, twelve billion, one hundred twenty million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •