Base | Representation |
---|---|
bin | 10111000000110101001000… |
… | …100010000100101101111011 |
3 | 111021100210011202020111221201 |
4 | 113000311020202010231323 |
5 | 101231224411013101021 |
6 | 555132112343115031 |
7 | 30214222500423052 |
oct | 2700651042045573 |
9 | 437323152214851 |
10 | 101212121222011 |
11 | 2a281901920818 |
12 | b427706742a77 |
13 | 4462353a29667 |
14 | 1adc99b0b1399 |
15 | ba7b5d6c3591 |
hex | 5c0d48884b7b |
101212121222011 has 16 divisors (see below), whose sum is σ = 105591995308800. Its totient is φ = 96932957532768.
The previous prime is 101212121221997. The next prime is 101212121222039. The reversal of 101212121222011 is 110222121212101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 101212121222011 - 25 = 101212121221979 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 101212121222011.
It is not an unprimeable number, because it can be changed into a prime (101212121220011) 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, 50291271 + ... + 52265056.
It is an arithmetic number, because the mean of its divisors is an integer number (6599499706800).
Almost surely, 2101212121222011 is an apocalyptic number.
101212121222011 is a deficient number, since it is larger than the sum of its proper divisors (4379874086789).
101212121222011 is a wasteful number, since it uses less digits than its factorization.
101212121222011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102556818.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 101212121222011 its reverse (110222121212101), we get a palindrome (211434242434112).
The spelling of 101212121222011 in words is "one hundred one trillion, two hundred twelve billion, one hundred twenty-one million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •