Base | Representation |
---|---|
bin | 1001010100101100001001… |
… | …1101000001010001010101 |
3 | 1100021222202121021220211212 |
4 | 2111023002131001101111 |
5 | 2320423124403334131 |
6 | 33445134103111205 |
7 | 2105420453223026 |
oct | 225130235012125 |
9 | 40258677256755 |
10 | 10251054355541 |
11 | 32a24a1a3718a |
12 | 1196881442505 |
13 | 5948937a631c |
14 | 27622199ac4d |
15 | 12b9c05c8a2b |
hex | 952c2741455 |
10251054355541 has 2 divisors, whose sum is σ = 10251054355542. Its totient is φ = 10251054355540.
The previous prime is 10251054355519. The next prime is 10251054355561. The reversal of 10251054355541 is 14555345015201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6764446731025 + 3486607624516 = 2600855^2 + 1867246^2 .
It is an emirp because it is prime and its reverse (14555345015201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10251054355541 - 210 = 10251054354517 is a prime.
It is a super-2 number, since 2×102510543555412 (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 (10251054355561) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5125527177770 + 5125527177771.
It is an arithmetic number, because the mean of its divisors is an integer number (5125527177771).
Almost surely, 210251054355541 is an apocalyptic number.
It is an amenable number.
10251054355541 is a deficient number, since it is larger than the sum of its proper divisors (1).
10251054355541 is an equidigital number, since it uses as much as digits as its factorization.
10251054355541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 300000, while the sum is 41.
The spelling of 10251054355541 in words is "ten trillion, two hundred fifty-one billion, fifty-four million, three hundred fifty-five thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •