Base | Representation |
---|---|
bin | 1001001001001011100000… |
… | …1011100001010100010011 |
3 | 1022121002100200222200112120 |
4 | 2102102320023201110103 |
5 | 2304203141224003220 |
6 | 33214232314225323 |
7 | 2055220323541212 |
oct | 222227013412423 |
9 | 38532320880476 |
10 | 10053313500435 |
11 | 322664a421a87 |
12 | 1164496425243 |
13 | 57c03c52649a |
14 | 26a823951079 |
15 | 12679a655a40 |
hex | 924b82e1513 |
10053313500435 has 32 divisors (see below), whose sum is σ = 16099888347648. Its totient is φ = 5356906790400.
The previous prime is 10053313500427. The next prime is 10053313500449. The reversal of 10053313500435 is 53400531335001.
It is a happy number.
It is not a de Polignac number, because 10053313500435 - 23 = 10053313500427 is a prime.
It is a super-2 number, since 2×100533135004352 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10053313500396 and 10053313500405.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 91797460 + ... + 91906910.
It is an arithmetic number, because the mean of its divisors is an integer number (503121510864).
Almost surely, 210053313500435 is an apocalyptic number.
10053313500435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10053313500435 is a deficient number, since it is larger than the sum of its proper divisors (6046574847213).
10053313500435 is a wasteful number, since it uses less digits than its factorization.
10053313500435 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114955.
The product of its (nonzero) digits is 40500, while the sum is 33.
Adding to 10053313500435 its reverse (53400531335001), we get a palindrome (63453844835436).
The spelling of 10053313500435 in words is "ten trillion, fifty-three billion, three hundred thirteen million, five hundred thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •