Base | Representation |
---|---|
bin | 10011000110010010… |
… | …01111011010100101 |
3 | 222110120101200100012 |
4 | 21203021033122211 |
5 | 131444321121123 |
6 | 4413231500005 |
7 | 512041424015 |
oct | 114311173245 |
9 | 28416350305 |
10 | 10253301413 |
11 | 43917a3123 |
12 | 1ba1987605 |
13 | c75317774 |
14 | 6d3a5bc45 |
15 | 400245378 |
hex | 26324f6a5 |
10253301413 has 2 divisors, whose sum is σ = 10253301414. Its totient is φ = 10253301412.
The previous prime is 10253301397. The next prime is 10253301427. The reversal of 10253301413 is 31410335201.
10253301413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10160236804 + 93064609 = 100798^2 + 9647^2 .
It is a cyclic number.
It is not a de Polignac number, because 10253301413 - 24 = 10253301397 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10253301433) 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, 5126650706 + 5126650707.
It is an arithmetic number, because the mean of its divisors is an integer number (5126650707).
Almost surely, 210253301413 is an apocalyptic number.
It is an amenable number.
10253301413 is a deficient number, since it is larger than the sum of its proper divisors (1).
10253301413 is an equidigital number, since it uses as much as digits as its factorization.
10253301413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 10253301413 its reverse (31410335201), we get a palindrome (41663636614).
The spelling of 10253301413 in words is "ten billion, two hundred fifty-three million, three hundred one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •