Base | Representation |
---|---|
bin | 1001000110001100110000… |
… | …1110000011001011101001 |
3 | 1022102012012020202110010200 |
4 | 2101203030032003023221 |
5 | 2302333310141201301 |
6 | 33134523403502413 |
7 | 2051425420036032 |
oct | 221431416031351 |
9 | 38365166673120 |
10 | 10002110100201 |
11 | 320696444058a |
12 | 1156586527a09 |
13 | 57726c37171b |
14 | 268167487a89 |
15 | 1252a0302c86 |
hex | 918cc3832e9 |
10002110100201 has 12 divisors (see below), whose sum is σ = 15207886702320. Its totient is φ = 6317122168440.
The previous prime is 10002110100167. The next prime is 10002110100211. The reversal of 10002110100201 is 10200101120001.
It is a happy number.
It is not a de Polignac number, because 10002110100201 - 29 = 10002110099689 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 (10002110100211) 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 11 ways as a sum of consecutive naturals, for example, 29245935795 + ... + 29245936136.
It is an arithmetic number, because the mean of its divisors is an integer number (1267323891860).
Almost surely, 210002110100201 is an apocalyptic number.
It is an amenable number.
10002110100201 is a deficient number, since it is larger than the sum of its proper divisors (5205776602119).
10002110100201 is a wasteful number, since it uses less digits than its factorization.
10002110100201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58491871956 (or 58491871953 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10002110100201 its reverse (10200101120001), we get a palindrome (20202211220202).
The spelling of 10002110100201 in words is "ten trillion, two billion, one hundred ten million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •