Base | Representation |
---|---|
bin | 10111000000110101000001… |
… | …010011101001110010111011 |
3 | 111021100202212022010212021110 |
4 | 113000311001103221302323 |
5 | 101231224134000014321 |
6 | 555132052333011403 |
7 | 30214216466155461 |
oct | 2700650123516273 |
9 | 437322768125243 |
10 | 101212000001211 |
11 | 2a28184a455840 |
12 | b427692023b63 |
13 | 4462334895b88 |
14 | 1adc988d58831 |
15 | ba7b52c2b176 |
hex | 5c0d414e9cbb |
101212000001211 has 32 divisors (see below), whose sum is σ = 152319112243200. Its totient is φ = 59215615182080.
The previous prime is 101212000001191. The next prime is 101212000001221. The reversal of 101212000001211 is 112100000212101.
It is a cyclic number.
It is not a de Polignac number, because 101212000001211 - 210 = 101212000000187 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101212000001221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2957826 + ... + 14531783.
It is an arithmetic number, because the mean of its divisors is an integer number (4759972257600).
Almost surely, 2101212000001211 is an apocalyptic number.
101212000001211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101212000001211 is a deficient number, since it is larger than the sum of its proper divisors (51107112241989).
101212000001211 is a wasteful number, since it uses less digits than its factorization.
101212000001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17495699.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101212000001211 its reverse (112100000212101), we get a palindrome (213312000213312).
The spelling of 101212000001211 in words is "one hundred one trillion, two hundred twelve billion, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •