Base | Representation |
---|---|
bin | 1001010100110011100101… |
… | …1110110101100010110111 |
3 | 1100022011220202221020210010 |
4 | 2111030321132311202313 |
5 | 2320441222114224003 |
6 | 33450104201031303 |
7 | 2105521112154225 |
oct | 225147136654267 |
9 | 40264822836703 |
10 | 10253051320503 |
11 | 32a33271a0552 |
12 | 119713a185533 |
13 | 594b2142a0b4 |
14 | 276370ca5b15 |
15 | 12ba8aa8c003 |
hex | 953397b58b7 |
10253051320503 has 8 divisors (see below), whose sum is σ = 13672131388416. Its totient is φ = 6834669399800.
The previous prime is 10253051320471. The next prime is 10253051320507. The reversal of 10253051320503 is 30502315035201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10253051320503 - 25 = 10253051320471 is a prime.
It is a super-2 number, since 2×102530513205032 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10253051320507) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 174502533 + ... + 174561278.
It is an arithmetic number, because the mean of its divisors is an integer number (1709016423552).
Almost surely, 210253051320503 is an apocalyptic number.
10253051320503 is a deficient number, since it is larger than the sum of its proper divisors (3419080067913).
10253051320503 is an equidigital number, since it uses as much as digits as its factorization.
10253051320503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349073605.
The product of its (nonzero) digits is 13500, while the sum is 30.
Adding to 10253051320503 its reverse (30502315035201), we get a palindrome (40755366355704).
The spelling of 10253051320503 in words is "ten trillion, two hundred fifty-three billion, fifty-one million, three hundred twenty thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •