Base | Representation |
---|---|
bin | 10011011011010010… |
… | …11100011101101001 |
3 | 222220211222021210111 |
4 | 21231221130131221 |
5 | 132324424000000 |
6 | 4442524414321 |
7 | 516311264044 |
oct | 115551343551 |
9 | 28824867714 |
10 | 10429515625 |
11 | 447220a501 |
12 | 20309a73a1 |
13 | ca2994429 |
14 | 70d20bc5b |
15 | 410951cba |
hex | 26da5c769 |
10429515625 has 63 divisors (see below), whose sum is σ = 14086401723. Its totient is φ = 7720650000.
The previous prime is 10429515619. The next prime is 10429515643. The reversal of 10429515625 is 52651592401.
The square root of 10429515625 is 102125.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 3 ways, for example, as 9137256921 + 1292258704 = 95589^2 + 35948^2 .
It is not a de Polignac number, because 10429515625 - 23 = 10429515617 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 62 ways as a sum of consecutive naturals, for example, 242546854 + ... + 242546896.
Almost surely, 210429515625 is an apocalyptic number.
10429515625 is the 102125-th square number.
10429515625 is the 51063-rd centered octagonal number.
It is an amenable number.
10429515625 is a deficient number, since it is larger than the sum of its proper divisors (3656886098).
10429515625 is an frugal number, since it uses more digits than its factorization.
10429515625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154 (or 67 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 40.
It can be divided in two parts, 1042951 and 5625, that added together give a 20-th power (1048576 = 220).
The spelling of 10429515625 in words is "ten billion, four hundred twenty-nine million, five hundred fifteen thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •