Base | Representation |
---|---|
bin | 10111011100010101011010… |
… | …101010100000000010100001 |
3 | 111112001110211100200011121000 |
4 | 113130111122222200002201 |
5 | 102003211312010444301 |
6 | 1003140300223222213 |
7 | 30500613621630054 |
oct | 2734253252400241 |
9 | 445043740604530 |
10 | 103102211031201 |
11 | 2a940447292468 |
12 | b691a95a47969 |
13 | 456b65c579c65 |
14 | 1b66260678a9b |
15 | bdbdd23e8786 |
hex | 5dc55aaa00a1 |
103102211031201 has 8 divisors (see below), whose sum is σ = 152744016342560. Its totient is φ = 68734807354116.
The previous prime is 103102211031199. The next prime is 103102211031217. The reversal of 103102211031201 is 102130112201301.
103102211031201 is a `hidden beast` number, since 1 + 0 + 310 + 221 + 10 + 3 + 120 + 1 = 666.
It is not a de Polignac number, because 103102211031201 - 21 = 103102211031199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103102211431201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1909300204255 + ... + 1909300204308.
It is an arithmetic number, because the mean of its divisors is an integer number (19093002042820).
Almost surely, 2103102211031201 is an apocalyptic number.
It is an amenable number.
103102211031201 is a deficient number, since it is larger than the sum of its proper divisors (49641805311359).
103102211031201 is an equidigital number, since it uses as much as digits as its factorization.
103102211031201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3818600408572 (or 3818600408566 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 103102211031201 its reverse (102130112201301), we get a palindrome (205232323232502).
The spelling of 103102211031201 in words is "one hundred three trillion, one hundred two billion, two hundred eleven million, thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.233 sec. • engine limits •