Base | Representation |
---|---|
bin | 10011001100000111… |
… | …00100001100010001 |
3 | 222120222022012112221 |
4 | 21212003210030101 |
5 | 132044322122142 |
6 | 4422134421041 |
7 | 513203535013 |
oct | 114603441421 |
9 | 28528265487 |
10 | 10302145297 |
11 | 4407324274 |
12 | 1bb6201781 |
13 | c82489882 |
14 | 6da3341b3 |
15 | 404692767 |
hex | 2660e4311 |
10302145297 has 2 divisors, whose sum is σ = 10302145298. Its totient is φ = 10302145296.
The previous prime is 10302145291. The next prime is 10302145313. The reversal of 10302145297 is 79254120301.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10301438016 + 707281 = 101496^2 + 841^2 .
It is an emirp because it is prime and its reverse (79254120301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10302145297 - 227 = 10167927569 is a prime.
It is a super-2 number, since 2×103021452972 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10302145291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5151072648 + 5151072649.
It is an arithmetic number, because the mean of its divisors is an integer number (5151072649).
Almost surely, 210302145297 is an apocalyptic number.
It is an amenable number.
10302145297 is a deficient number, since it is larger than the sum of its proper divisors (1).
10302145297 is an equidigital number, since it uses as much as digits as its factorization.
10302145297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 34.
Adding to 10302145297 its reverse (79254120301), we get a palindrome (89556265598).
The spelling of 10302145297 in words is "ten billion, three hundred two million, one hundred forty-five thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •