Base | Representation |
---|---|
bin | 11101011001101101000… |
… | …01010111001110101111 |
3 | 10120120120210210102002211 |
4 | 32230312201113032233 |
5 | 113022423344431002 |
6 | 2052032202231251 |
7 | 132662330400445 |
oct | 16546641271657 |
9 | 3516523712084 |
10 | 1010232030127 |
11 | 35a48970a641 |
12 | 1439587b5527 |
13 | 74359076338 |
14 | 36c77328b95 |
15 | 1b429ba8dd7 |
hex | eb368573af |
1010232030127 has 2 divisors, whose sum is σ = 1010232030128. Its totient is φ = 1010232030126.
The previous prime is 1010232030107. The next prime is 1010232030173. The reversal of 1010232030127 is 7210302320101.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (7210302320101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1010232030127 - 231 = 1008084546479 is a prime.
It is a super-2 number, since 2×10102320301272 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1010232030098 and 1010232030107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010232030107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505116015063 + 505116015064.
It is an arithmetic number, because the mean of its divisors is an integer number (505116015064).
Almost surely, 21010232030127 is an apocalyptic number.
1010232030127 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010232030127 is an equidigital number, since it uses as much as digits as its factorization.
1010232030127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 504, while the sum is 22.
Adding to 1010232030127 its reverse (7210302320101), we get a palindrome (8220534350228).
The spelling of 1010232030127 in words is "one trillion, ten billion, two hundred thirty-two million, thirty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •