Base | Representation |
---|---|
bin | 1001100000100100000000… |
… | …0000100110001111100001 |
3 | 1101000111020121201112010111 |
4 | 2120021000000212033201 |
5 | 2332243342210000204 |
6 | 34122545530531321 |
7 | 2126231151142132 |
oct | 230110000461741 |
9 | 41014217645114 |
10 | 10455024296929 |
11 | 3370a50721083 |
12 | 120a306596b41 |
13 | 5aab9b421334 |
14 | 282051009c89 |
15 | 131e5c336d04 |
hex | 982400263e1 |
10455024296929 has 9 divisors (see below), whose sum is σ = 10481394395667. Its totient is φ = 10428720400824.
The previous prime is 10455024296921. The next prime is 10455024296957. The reversal of 10455024296929 is 92969242055401.
The square root of 10455024296929 is 3233423.
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., 5128843443025 + 5326180853904 = 2264695^2 + 2307852^2 .
It is not a de Polignac number, because 10455024296929 - 23 = 10455024296921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10455024296921) 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, 1354800379 + ... + 1354808095.
Almost surely, 210455024296929 is an apocalyptic number.
10455024296929 is the 3233423-rd square number.
10455024296929 is the 1616712-nd centered octagonal number.
It is an amenable number.
10455024296929 is a deficient number, since it is larger than the sum of its proper divisors (26370098738).
10455024296929 is an frugal number, since it uses more digits than its factorization.
10455024296929 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16272 (or 8136 counting only the distinct ones).
The product of its (nonzero) digits is 13996800, while the sum is 58.
The spelling of 10455024296929 in words is "ten trillion, four hundred fifty-five billion, twenty-four million, two hundred ninety-six thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •