Base | Representation |
---|---|
bin | 1001010100000101010101… |
… | …0110100110010110000101 |
3 | 1100020222212101121002110220 |
4 | 2111001111112212112011 |
5 | 2320240304302140003 |
6 | 33440252103134553 |
7 | 2104601312645466 |
oct | 225012526462605 |
9 | 40228771532426 |
10 | 10240634021253 |
11 | 3299034a28869 |
12 | 1194853744459 |
13 | 5938c29a7c4c |
14 | 275913a9cd6d |
15 | 12b5b088c353 |
hex | 950555a6585 |
10240634021253 has 8 divisors (see below), whose sum is σ = 13713803930400. Its totient is φ = 6797276729808.
The previous prime is 10240634021243. The next prime is 10240634021257. The reversal of 10240634021253 is 35212043604201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10240634021253 - 221 = 10240631924101 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10240634021257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7453153623 + ... + 7453154996.
It is an arithmetic number, because the mean of its divisors is an integer number (1714225491300).
Almost surely, 210240634021253 is an apocalyptic number.
It is an amenable number.
10240634021253 is a deficient number, since it is larger than the sum of its proper divisors (3473169909147).
10240634021253 is a wasteful number, since it uses less digits than its factorization.
10240634021253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14906308851.
The product of its (nonzero) digits is 34560, while the sum is 33.
Adding to 10240634021253 its reverse (35212043604201), we get a palindrome (45452677625454).
The spelling of 10240634021253 in words is "ten trillion, two hundred forty billion, six hundred thirty-four million, twenty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •