Base | Representation |
---|---|
bin | 11101011001010010100… |
… | …10011000111010000011 |
3 | 10120120000100000011102211 |
4 | 32230221102120322003 |
5 | 113022000030013102 |
6 | 2051554151322551 |
7 | 132653663233336 |
oct | 16545122307203 |
9 | 3516010004384 |
10 | 1010010001027 |
11 | 35a385350915 |
12 | 1438b6380457 |
13 | 74322078181 |
14 | 36c55a5061d |
15 | 1b41544c7d7 |
hex | eb29498e83 |
1010010001027 has 2 divisors, whose sum is σ = 1010010001028. Its totient is φ = 1010010001026.
The previous prime is 1010010000973. The next prime is 1010010001073. The reversal of 1010010001027 is 7201000100101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1010010001027 - 239 = 460254187139 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1010010000998 and 1010010001016.
It is not a weakly prime, because it can be changed into another prime (1010010001097) 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 as a sum of consecutive naturals, namely, 505005000513 + 505005000514.
It is an arithmetic number, because the mean of its divisors is an integer number (505005000514).
Almost surely, 21010010001027 is an apocalyptic number.
1010010001027 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010010001027 is an equidigital number, since it uses as much as digits as its factorization.
1010010001027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14, while the sum is 13.
Adding to 1010010001027 its reverse (7201000100101), we get a palindrome (8211010101128).
The spelling of 1010010001027 in words is "one trillion, ten billion, ten million, one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •