Base | Representation |
---|---|
bin | 11101111110111100111… |
… | …11100111000011011111 |
3 | 10122111012111112011011211 |
4 | 32333132133213003133 |
5 | 113334402340342002 |
6 | 2105140420325251 |
7 | 134301026421121 |
oct | 16773637470337 |
9 | 3574174464154 |
10 | 1030230012127 |
11 | 367a10a90498 |
12 | 1477b9b43827 |
13 | 761c51c5594 |
14 | 37c13247211 |
15 | 1bbea676dd7 |
hex | efde7e70df |
1030230012127 has 2 divisors, whose sum is σ = 1030230012128. Its totient is φ = 1030230012126.
The previous prime is 1030230012109. The next prime is 1030230012139. The reversal of 1030230012127 is 7212100320301.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1030230012127 is a prime.
It is a super-2 number, since 2×10302300121272 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030230012098 and 1030230012107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1030230012167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515115006063 + 515115006064.
It is an arithmetic number, because the mean of its divisors is an integer number (515115006064).
Almost surely, 21030230012127 is an apocalyptic number.
1030230012127 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030230012127 is an equidigital number, since it uses as much as digits as its factorization.
1030230012127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 22.
Adding to 1030230012127 its reverse (7212100320301), we get a palindrome (8242330332428).
The spelling of 1030230012127 in words is "one trillion, thirty billion, two hundred thirty million, twelve thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •