Base | Representation |
---|---|
bin | 10000011100011001010… |
… | …001000011110011001001 |
3 | 11000000201122220222100112 |
4 | 100130121101003303021 |
5 | 122003220034120012 |
6 | 2223040500044105 |
7 | 144432314036462 |
oct | 20343121036311 |
9 | 4000648828315 |
10 | 1130000301257 |
11 | 3a62597903a3 |
12 | 163002993635 |
13 | 82735247519 |
14 | 3c99998dd69 |
15 | 1e5d9639122 |
hex | 10719443cc9 |
1130000301257 has 2 divisors, whose sum is σ = 1130000301258. Its totient is φ = 1130000301256.
The previous prime is 1130000301169. The next prime is 1130000301259. The reversal of 1130000301257 is 7521030000311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1042939307536 + 87060993721 = 1021244^2 + 295061^2 .
It is a cyclic number.
It is not a de Polignac number, because 1130000301257 - 212 = 1130000297161 is a prime.
Together with 1130000301259, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1130000301259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 565000150628 + 565000150629.
It is an arithmetic number, because the mean of its divisors is an integer number (565000150629).
Almost surely, 21130000301257 is an apocalyptic number.
It is an amenable number.
1130000301257 is a deficient number, since it is larger than the sum of its proper divisors (1).
1130000301257 is an equidigital number, since it uses as much as digits as its factorization.
1130000301257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630, while the sum is 23.
Adding to 1130000301257 its reverse (7521030000311), we get a palindrome (8651030301568).
The spelling of 1130000301257 in words is "one trillion, one hundred thirty billion, three hundred one thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •