Base | Representation |
---|---|
bin | 10111000000101001111101… |
… | …010001101010110011011001 |
3 | 111021022122012110002212000222 |
4 | 113000221331101222303121 |
5 | 101231030322012241441 |
6 | 555122405513205425 |
7 | 30213316226135351 |
oct | 2700517521526331 |
9 | 437278173085028 |
10 | 101200121212121 |
11 | 2a277804162778 |
12 | b425317a00875 |
13 | 44611908904a9 |
14 | 1adc17d48db61 |
15 | ba76a9e4ed4b |
hex | 5c0a7d46acd9 |
101200121212121 has 16 divisors (see below), whose sum is σ = 108794951116800. Its totient is φ = 93832216620048.
The previous prime is 101200121212117. The next prime is 101200121212181. The reversal of 101200121212121 is 121212121002101.
It is a cyclic number.
It is not a de Polignac number, because 101200121212121 - 22 = 101200121212117 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101200121212121.
It is not an unprimeable number, because it can be changed into a prime (101200121212111) 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, 49235750 + ... + 51249968.
It is an arithmetic number, because the mean of its divisors is an integer number (6799684444800).
Almost surely, 2101200121212121 is an apocalyptic number.
It is an amenable number.
101200121212121 is a deficient number, since it is larger than the sum of its proper divisors (7594829904679).
101200121212121 is a wasteful number, since it uses less digits than its factorization.
101200121212121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2070548.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 101200121212121 its reverse (121212121002101), we get a palindrome (222412242214222).
The spelling of 101200121212121 in words is "one hundred one trillion, two hundred billion, one hundred twenty-one million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •