Base | Representation |
---|---|
bin | 11101011001101001010… |
… | …11011101000111001011 |
3 | 10120120111122122002001202 |
4 | 32230310223131013023 |
5 | 113022342441334402 |
6 | 2052025135534415 |
7 | 132661503565154 |
oct | 16546453350713 |
9 | 3516448562052 |
10 | 1010201121227 |
11 | 35a4732192a1 |
12 | 14394a38a40b |
13 | 7435284374c |
14 | 36c731a092b |
15 | 1b427100b02 |
hex | eb34add1cb |
1010201121227 has 2 divisors, whose sum is σ = 1010201121228. Its totient is φ = 1010201121226.
The previous prime is 1010201121173. The next prime is 1010201121269. The reversal of 1010201121227 is 7221211020101.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1010201121227 - 222 = 1010196926923 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1010201121199 and 1010201121208.
It is not a weakly prime, because it can be changed into another prime (1010201127227) 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 as a sum of consecutive naturals, namely, 505100560613 + 505100560614.
It is an arithmetic number, because the mean of its divisors is an integer number (505100560614).
Almost surely, 21010201121227 is an apocalyptic number.
1010201121227 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010201121227 is an equidigital number, since it uses as much as digits as its factorization.
1010201121227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 1010201121227 its reverse (7221211020101), we get a palindrome (8231412141328).
The spelling of 1010201121227 in words is "one trillion, ten billion, two hundred one million, one hundred twenty-one thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •