Base | Representation |
---|---|
bin | 101111000010101010… |
… | …0111111101010111011 |
3 | 100122202100001200012211 |
4 | 1132011110333222323 |
5 | 3123342401334321 |
6 | 114224121115551 |
7 | 10204253235163 |
oct | 1360524775273 |
9 | 318670050184 |
10 | 101021121211 |
11 | 3992a87562a |
12 | 176b3928bb7 |
13 | 96ac23348a |
14 | 4c649095a3 |
15 | 2963bde0e1 |
hex | 178553fabb |
101021121211 has 4 divisors (see below), whose sum is σ = 101280816000. Its totient is φ = 100761426424.
The previous prime is 101021121169. The next prime is 101021121217. The reversal of 101021121211 is 112121120101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101021121211 - 223 = 101012732603 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101021121191 and 101021121200.
It is not an unprimeable number, because it can be changed into a prime (101021121217) 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 3 ways as a sum of consecutive naturals, for example, 129846811 + ... + 129847588.
It is an arithmetic number, because the mean of its divisors is an integer number (25320204000).
Almost surely, 2101021121211 is an apocalyptic number.
101021121211 is a deficient number, since it is larger than the sum of its proper divisors (259694789).
101021121211 is an equidigital number, since it uses as much as digits as its factorization.
101021121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259694788.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101021121211 its reverse (112121120101), we get a palindrome (213142241312).
The spelling of 101021121211 in words is "one hundred one billion, twenty-one million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •