Base | Representation |
---|---|
bin | 10011011001100011… |
… | …000001010110011001 |
3 | 1222202122202200101201 |
4 | 103121203001112121 |
5 | 320124401040000 |
6 | 13322524514201 |
7 | 1335115401511 |
oct | 233143012631 |
9 | 58678680351 |
10 | 20829705625 |
11 | 891990a153 |
12 | 40539ab961 |
13 | 1c6c55b801 |
14 | 1018584841 |
15 | 81da0e96a |
hex | 4d98c1599 |
20829705625 has 45 divisors (see below), whose sum is σ = 27318527929. Its totient is φ = 15875750000.
The previous prime is 20829705613. The next prime is 20829705691. The reversal of 20829705625 is 52650792802.
The square root of 20829705625 is 144325.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 2 ways, for example, as 1633048921 + 19196656704 = 40411^2 + 138552^2 .
It is not a de Polignac number, because 20829705625 - 25 = 20829705593 is a prime.
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 82986750 + ... + 82987000.
Almost surely, 220829705625 is an apocalyptic number.
20829705625 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
20829705625 is the 144325-th square number.
20829705625 is the 72163-rd centered octagonal number.
It is an amenable number.
20829705625 is a deficient number, since it is larger than the sum of its proper divisors (6488822304).
20829705625 is an frugal number, since it uses more digits than its factorization.
20829705625 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 568 (or 279 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 46.
The spelling of 20829705625 in words is "twenty billion, eight hundred twenty-nine million, seven hundred five thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •