Base | Representation |
---|---|
bin | 1001001110001111011000… |
… | …1101000000111011011101 |
3 | 1022220101202200210110211111 |
4 | 2103203312031000323131 |
5 | 2312114214334102443 |
6 | 33322211302422021 |
7 | 2064415634653141 |
oct | 223436615007335 |
9 | 38811680713744 |
10 | 10140253425373 |
11 | 325a503780415 |
12 | 11792ba431911 |
13 | 5872b638c056 |
14 | 270b10289221 |
15 | 128b8802369d |
hex | 938f6340edd |
10140253425373 has 2 divisors, whose sum is σ = 10140253425374. Its totient is φ = 10140253425372.
The previous prime is 10140253425329. The next prime is 10140253425377. The reversal of 10140253425373 is 37352435204101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9609516406084 + 530737019289 = 3099922^2 + 728517^2 .
It is a cyclic number.
It is not a de Polignac number, because 10140253425373 - 237 = 10002814471901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10140253425377) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5070126712686 + 5070126712687.
It is an arithmetic number, because the mean of its divisors is an integer number (5070126712687).
Almost surely, 210140253425373 is an apocalyptic number.
It is an amenable number.
10140253425373 is a deficient number, since it is larger than the sum of its proper divisors (1).
10140253425373 is an equidigital number, since it uses as much as digits as its factorization.
10140253425373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 302400, while the sum is 40.
Adding to 10140253425373 its reverse (37352435204101), we get a palindrome (47492688629474).
The spelling of 10140253425373 in words is "ten trillion, one hundred forty billion, two hundred fifty-three million, four hundred twenty-five thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •