Base | Representation |
---|---|
bin | 101111000010010101… |
… | …1000010000111111011 |
3 | 100122201120100211001102 |
4 | 1132010223002013323 |
5 | 3123332042334321 |
6 | 114223045242015 |
7 | 10204060602206 |
oct | 1360453020773 |
9 | 318646324042 |
10 | 101010121211 |
11 | 3992464211a |
12 | 176b010330b |
13 | 96a9b816bc |
14 | 4c6328493d |
15 | 2962c69c0b |
hex | 1784ac21fb |
101010121211 has 16 divisors (see below), whose sum is σ = 106511072640. Its totient is φ = 95527823040.
The previous prime is 101010121193. The next prime is 101010121231. The reversal of 101010121211 is 112121010101.
It is not a de Polignac number, because 101010121211 - 222 = 101005926907 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101010121192 and 101010121201.
It is not an unprimeable number, because it can be changed into a prime (101010121231) 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 15 ways as a sum of consecutive naturals, for example, 48491576 + ... + 48493658.
It is an arithmetic number, because the mean of its divisors is an integer number (6656942040).
Almost surely, 2101010121211 is an apocalyptic number.
101010121211 is a deficient number, since it is larger than the sum of its proper divisors (5500951429).
101010121211 is a wasteful number, since it uses less digits than its factorization.
101010121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5306.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101010121211 its reverse (112121010101), we get a palindrome (213131131312).
The spelling of 101010121211 in words is "one hundred one billion, ten million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •