Base | Representation |
---|---|
bin | 11101111011110001… |
… | …00110010111000100 |
3 | 1112110222201201220221 |
4 | 32331320212113010 |
5 | 230403040223100 |
6 | 11214401234124 |
7 | 1106150061100 |
oct | 167570462704 |
9 | 45428651827 |
10 | 16070632900 |
11 | 68a74a93a3 |
12 | 3146032944 |
13 | 16915b6b4a |
14 | ac64ba900 |
15 | 640ce901a |
hex | 3bde265c4 |
16070632900 has 81 divisors (see below), whose sum is σ = 40589281677. Its totient is φ = 5506888800.
The previous prime is 16070632859. The next prime is 16070632969. The reversal of 16070632900 is 923607061.
The square root of 16070632900 is 126770.
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., 5785427844 + 10285205056 = 76062^2 + 101416^2 .
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 26 ways as a sum of consecutive naturals, for example, 8872995 + ... + 8874805.
Almost surely, 216070632900 is an apocalyptic number.
16070632900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16070632900 is the 126770-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16070632900
16070632900 is an abundant number, since it is smaller than the sum of its proper divisors (24518648777).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16070632900 is an equidigital number, since it uses as much as digits as its factorization.
16070632900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3650 (or 1825 counting only the distinct ones).
The product of its (nonzero) digits is 13608, while the sum is 34.
The spelling of 16070632900 in words is "sixteen billion, seventy million, six hundred thirty-two thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •