Base | Representation |
---|---|
bin | 1001001001001011001100… |
… | …1111100111000100011001 |
3 | 1022121002010221011022011101 |
4 | 2102102303033213010121 |
5 | 2304203004023431424 |
6 | 33214220155231401 |
7 | 2055215266615144 |
oct | 222226317470431 |
9 | 38532127138141 |
10 | 10053230686489 |
11 | 32266076a9701 |
12 | 1164472748561 |
13 | 57c02831c353 |
14 | 26a81695505b |
15 | 126793248344 |
hex | 924b33e7119 |
10053230686489 has 9 divisors (see below), whose sum is σ = 10176079646719. Its totient is φ = 9931847429200.
The previous prime is 10053230686483. The next prime is 10053230686529. The reversal of 10053230686489 is 98468603235001.
The square root of 10053230686489 is 3170683.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 3886153796889 + 6167076889600 = 1971333^2 + 2483360^2 .
It is not a de Polignac number, because 10053230686489 - 213 = 10053230678297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10053230686483) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 263147589 + ... + 263185789.
Almost surely, 210053230686489 is an apocalyptic number.
10053230686489 is the 3170683-rd square number.
10053230686489 is the 1585342-nd centered octagonal number.
It is an amenable number.
10053230686489 is a deficient number, since it is larger than the sum of its proper divisors (122848960230).
10053230686489 is an frugal number, since it uses more digits than its factorization.
10053230686489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76568 (or 38284 counting only the distinct ones).
The product of its (nonzero) digits is 7464960, while the sum is 55.
The spelling of 10053230686489 in words is "ten trillion, fifty-three billion, two hundred thirty million, six hundred eighty-six thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •