Base | Representation |
---|---|
bin | 10111000000101011101101… |
… | …010001001001000100001001 |
3 | 111021022211001101121101000020 |
4 | 113000223231101021010021 |
5 | 101231043144012401441 |
6 | 555123320152531053 |
7 | 30213413622456153 |
oct | 2700535521110411 |
9 | 437284041541006 |
10 | 101202000122121 |
11 | 2a278588813658 |
12 | b4257610b0a89 |
13 | 44613ccc1b762 |
14 | 1adc2bac27ad3 |
15 | ba7769d93e66 |
hex | 5c0aed449109 |
101202000122121 has 64 divisors (see below), whose sum is σ = 152688894059520. Its totient is φ = 59239496448000.
The previous prime is 101202000122057. The next prime is 101202000122137. The reversal of 101202000122121 is 121221000202101.
It is not a de Polignac number, because 101202000122121 - 26 = 101202000122057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101202000122121.
It is not an unprimeable number, because it can be changed into a prime (101202000122161) 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 63 ways as a sum of consecutive naturals, for example, 194574210 + ... + 195093636.
It is an arithmetic number, because the mean of its divisors is an integer number (2385763969680).
Almost surely, 2101202000122121 is an apocalyptic number.
It is an amenable number.
101202000122121 is a deficient number, since it is larger than the sum of its proper divisors (51486893937399).
101202000122121 is a wasteful number, since it uses less digits than its factorization.
101202000122121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 522534.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 101202000122121 its reverse (121221000202101), we get a palindrome (222423000324222).
The spelling of 101202000122121 in words is "one hundred one trillion, two hundred two billion, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •