Base | Representation |
---|---|
bin | 10111001110000010110110… |
… | …111010001000100000011001 |
3 | 111101120121010002121002222000 |
4 | 113032002312322020200121 |
5 | 101341114143021402301 |
6 | 1001105213301151213 |
7 | 30336641013262326 |
oct | 2716026672104031 |
9 | 441517102532860 |
10 | 102120211122201 |
11 | 2a5a1a35a01338 |
12 | b5536b80bb509 |
13 | 44c9b8254424c |
14 | 1b30904a83b4d |
15 | bc15ab057786 |
hex | 5ce0b6e88819 |
102120211122201 has 16 divisors (see below), whose sum is σ = 151851615062400. Its totient is φ = 67827054718224.
The previous prime is 102120211122179. The next prime is 102120211122343. The reversal of 102120211122201 is 102221112021201.
102120211122201 is a `hidden beast` number, since 10 + 2 + 120 + 211 + 122 + 201 = 666.
It is not a de Polignac number, because 102120211122201 - 215 = 102120211089433 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (102120211123201) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7030160101 + ... + 7030174626.
It is an arithmetic number, because the mean of its divisors is an integer number (9490725941400).
Almost surely, 2102120211122201 is an apocalyptic number.
It is an amenable number.
102120211122201 is a deficient number, since it is larger than the sum of its proper divisors (49731403940199).
102120211122201 is a wasteful number, since it uses less digits than its factorization.
102120211122201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14060335005 (or 14060334999 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 102120211122201 its reverse (102221112021201), we get a palindrome (204341323143402).
The spelling of 102120211122201 in words is "one hundred two trillion, one hundred twenty billion, two hundred eleven million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •