Base | Representation |
---|---|
bin | 1001001110010000000000… |
… | …1101010001100000101101 |
3 | 1022220102012101121122010202 |
4 | 2103210000031101200231 |
5 | 2312120040320443303 |
6 | 33322240100043245 |
7 | 2064423043404623 |
oct | 223440015214055 |
9 | 38812171548122 |
10 | 10140421265453 |
11 | 325a58a498126 |
12 | 1179346693525 |
13 | 5873120961cb |
14 | 270b28699513 |
15 | 128b97b28c88 |
hex | 9390035182d |
10140421265453 has 2 divisors, whose sum is σ = 10140421265454. Its totient is φ = 10140421265452.
The previous prime is 10140421265347. The next prime is 10140421265539. The reversal of 10140421265453 is 35456212404101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7069999148809 + 3070422116644 = 2658947^2 + 1752262^2 .
It is an emirp because it is prime and its reverse (35456212404101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10140421265453 - 226 = 10140354156589 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10140421265053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5070210632726 + 5070210632727.
It is an arithmetic number, because the mean of its divisors is an integer number (5070210632727).
Almost surely, 210140421265453 is an apocalyptic number.
It is an amenable number.
10140421265453 is a deficient number, since it is larger than the sum of its proper divisors (1).
10140421265453 is an equidigital number, since it uses as much as digits as its factorization.
10140421265453 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 115200, while the sum is 38.
Adding to 10140421265453 its reverse (35456212404101), we get a palindrome (45596633669554).
The spelling of 10140421265453 in words is "ten trillion, one hundred forty billion, four hundred twenty-one million, two hundred sixty-five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •