Base | Representation |
---|---|
bin | 1001010100010111110101… |
… | …1000011101011111101111 |
3 | 1100021110200112000200000011 |
4 | 2111011331120131133233 |
5 | 2320330442221041411 |
6 | 33442433001314051 |
7 | 2105135350611523 |
oct | 225057530353757 |
9 | 40243615020004 |
10 | 10245600565231 |
11 | 32a0153464869 |
12 | 11957baa95927 |
13 | 594204921775 |
14 | 275c65531d83 |
15 | 12b7a18d5c21 |
hex | 9517d61d7ef |
10245600565231 has 2 divisors, whose sum is σ = 10245600565232. Its totient is φ = 10245600565230.
The previous prime is 10245600565181. The next prime is 10245600565253. The reversal of 10245600565231 is 13256500654201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10245600565231 - 27 = 10245600565103 is a prime.
It is a super-2 number, since 2×102456005652312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10245600565331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5122800282615 + 5122800282616.
It is an arithmetic number, because the mean of its divisors is an integer number (5122800282616).
Almost surely, 210245600565231 is an apocalyptic number.
10245600565231 is a deficient number, since it is larger than the sum of its proper divisors (1).
10245600565231 is an equidigital number, since it uses as much as digits as its factorization.
10245600565231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216000, while the sum is 40.
The spelling of 10245600565231 in words is "ten trillion, two hundred forty-five billion, six hundred million, five hundred sixty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •