Base | Representation |
---|---|
bin | 1001000111011110010110… |
… | …1100001000010111000101 |
3 | 1022111021201122112001221202 |
4 | 2101313211230020113011 |
5 | 2303213134114040423 |
6 | 33152545002552245 |
7 | 2053132240205552 |
oct | 221674554102705 |
9 | 38437648461852 |
10 | 10024012252613 |
11 | 3215183655897 |
12 | 115a879508685 |
13 | 57934cb54818 |
14 | 269244237a29 |
15 | 125b33054728 |
hex | 91de5b085c5 |
10024012252613 has 2 divisors, whose sum is σ = 10024012252614. Its totient is φ = 10024012252612.
The previous prime is 10024012252603. The next prime is 10024012252679. The reversal of 10024012252613 is 31625221042001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6184164292804 + 3839847959809 = 2486798^2 + 1959553^2 .
It is an emirp because it is prime and its reverse (31625221042001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10024012252613 - 230 = 10022938510789 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10024012252603) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5012006126306 + 5012006126307.
It is an arithmetic number, because the mean of its divisors is an integer number (5012006126307).
Almost surely, 210024012252613 is an apocalyptic number.
It is an amenable number.
10024012252613 is a deficient number, since it is larger than the sum of its proper divisors (1).
10024012252613 is an equidigital number, since it uses as much as digits as its factorization.
10024012252613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 10024012252613 its reverse (31625221042001), we get a palindrome (41649233294614).
The spelling of 10024012252613 in words is "ten trillion, twenty-four billion, twelve million, two hundred fifty-two thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •