Base | Representation |
---|---|
bin | 11101011001011111110… |
… | …01110111001111110011 |
3 | 10120120022001220010011011 |
4 | 32230233321313033303 |
5 | 113022211434342321 |
6 | 2052013154531351 |
7 | 132656511636163 |
oct | 16545771671763 |
9 | 3516261803134 |
10 | 1010121012211 |
11 | 35a431a831a3 |
12 | 143927596b57 |
13 | 7433c07586c |
14 | 36c666aa5a3 |
15 | 1b420079ae1 |
hex | eb2fe773f3 |
1010121012211 has 8 divisors (see below), whose sum is σ = 1042726579200. Its totient is φ = 977516758920.
The previous prime is 1010121012193. The next prime is 1010121012221. The reversal of 1010121012211 is 1122101210101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1010121012211 - 27 = 1010121012083 is a prime.
It is a super-2 number, since 2×10101210122112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1010121012191 and 1010121012200.
It is not an unprimeable number, because it can be changed into a prime (1010121012221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1374450 + ... + 1977208.
It is an arithmetic number, because the mean of its divisors is an integer number (130340822400).
Almost surely, 21010121012211 is an apocalyptic number.
1010121012211 is a deficient number, since it is larger than the sum of its proper divisors (32605566989).
1010121012211 is an equidigital number, since it uses as much as digits as its factorization.
1010121012211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 656849.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1010121012211 its reverse (1122101210101), we get a palindrome (2132222222312).
The spelling of 1010121012211 in words is "one trillion, ten billion, one hundred twenty-one million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •