Base | Representation |
---|---|
bin | 1001011010101100111100… |
… | …0101100000100101010101 |
3 | 1100122212101010211021222120 |
4 | 2112223033011200211111 |
5 | 2324121144422330003 |
6 | 34004415355050153 |
7 | 2116035222446502 |
oct | 226531705404525 |
9 | 40585333737876 |
10 | 10354345511253 |
11 | 3332287116287 |
12 | 11b28a9440959 |
13 | 5a15450bc583 |
14 | 27b21db744a9 |
15 | 12e51871a853 |
hex | 96acf160955 |
10354345511253 has 8 divisors (see below), whose sum is σ = 13817767821888. Its totient is φ = 6896910104064.
The previous prime is 10354345511227. The next prime is 10354345511299. The reversal of 10354345511253 is 35211554345301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10354345511253 - 28 = 10354345510997 is a prime.
It is a super-3 number, since 3×103543455112533 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10354345511203) 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, 1496721825 + ... + 1496728742.
It is an arithmetic number, because the mean of its divisors is an integer number (1727220977736).
Almost surely, 210354345511253 is an apocalyptic number.
It is an amenable number.
10354345511253 is a deficient number, since it is larger than the sum of its proper divisors (3463422310635).
10354345511253 is a wasteful number, since it uses less digits than its factorization.
10354345511253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2993451723.
The product of its (nonzero) digits is 540000, while the sum is 42.
Adding to 10354345511253 its reverse (35211554345301), we get a palindrome (45565899856554).
The spelling of 10354345511253 in words is "ten trillion, three hundred fifty-four billion, three hundred forty-five million, five hundred eleven thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •