Base | Representation |
---|---|
bin | 1001010100101100001011… |
… | …0100111101110110110101 |
3 | 1100021222210001002211220211 |
4 | 2111023002310331312311 |
5 | 2320423133010224023 |
6 | 33445134445425421 |
7 | 2105420560456504 |
oct | 225130264756665 |
9 | 40258701084824 |
10 | 10251060633013 |
11 | 32a24a5534582 |
12 | 119688356b271 |
13 | 594894b936c5 |
14 | 27622275283b |
15 | 12b9c0e18a0d |
hex | 952c2d3ddb5 |
10251060633013 has 2 divisors, whose sum is σ = 10251060633014. Its totient is φ = 10251060633012.
The previous prime is 10251060632909. The next prime is 10251060633041. The reversal of 10251060633013 is 31033606015201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9936472015089 + 314588617924 = 3152217^2 + 560882^2 .
It is an emirp because it is prime and its reverse (31033606015201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10251060633013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10251060633053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5125530316506 + 5125530316507.
It is an arithmetic number, because the mean of its divisors is an integer number (5125530316507).
Almost surely, 210251060633013 is an apocalyptic number.
It is an amenable number.
10251060633013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10251060633013 is an equidigital number, since it uses as much as digits as its factorization.
10251060633013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9720, while the sum is 31.
Adding to 10251060633013 its reverse (31033606015201), we get a palindrome (41284666648214).
The spelling of 10251060633013 in words is "ten trillion, two hundred fifty-one billion, sixty million, six hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •