Base | Representation |
---|---|
bin | 1001010100010111110101… |
… | …1111000111101101111111 |
3 | 1100021110200122022100210201 |
4 | 2111011331133013231333 |
5 | 2320330443142423124 |
6 | 33442433102544331 |
7 | 2105135401502404 |
oct | 225057537075577 |
9 | 40243618270721 |
10 | 10245602311039 |
11 | 32a0154447487 |
12 | 11957bb5980a7 |
13 | 5942050b32a4 |
14 | 275c658682ab |
15 | 12b7a1b2d144 |
hex | 9517d7c7b7f |
10245602311039 has 2 divisors, whose sum is σ = 10245602311040. Its totient is φ = 10245602311038.
The previous prime is 10245602311037. The next prime is 10245602311069. The reversal of 10245602311039 is 93011320654201.
It is a weak prime.
It is an emirp because it is prime and its reverse (93011320654201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10245602311039 - 21 = 10245602311037 is a prime.
Together with 10245602311037, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 10245602310989 and 10245602311007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10245602311033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5122801155519 + 5122801155520.
It is an arithmetic number, because the mean of its divisors is an integer number (5122801155520).
Almost surely, 210245602311039 is an apocalyptic number.
10245602311039 is a deficient number, since it is larger than the sum of its proper divisors (1).
10245602311039 is an equidigital number, since it uses as much as digits as its factorization.
10245602311039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 37.
The spelling of 10245602311039 in words is "ten trillion, two hundred forty-five billion, six hundred two million, three hundred eleven thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •