Base | Representation |
---|---|
bin | 11101001110111101100… |
… | …01110010010001100100 |
3 | 10120000200220001112211201 |
4 | 32213132301302101210 |
5 | 112424121013113100 |
6 | 2045240030212244 |
7 | 132366402252514 |
oct | 16473661622144 |
9 | 3500626045751 |
10 | 1004464972900 |
11 | 357a9a322144 |
12 | 142809354084 |
13 | 7394a32a13c |
14 | 3688b435844 |
15 | 1b1dd73636a |
hex | e9dec72464 |
1004464972900 has 243 divisors, whose sum is σ = 2333816315649. Its totient is φ = 375234912000.
The previous prime is 1004464972867. The next prime is 1004464972913. The reversal of 1004464972900 is 92794644001.
The square root of 1004464972900 is 1002230.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 13 ways, for example, as 933917363236 + 70547609664 = 966394^2 + 265608^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 16466638870 + ... + 16466638930.
Almost surely, 21004464972900 is an apocalyptic number.
1004464972900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1004464972900 is the 1002230-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1004464972900
1004464972900 is an abundant number, since it is smaller than the sum of its proper divisors (1329351342749).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1004464972900 is an equidigital number, since it uses as much as digits as its factorization.
1004464972900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304 (or 152 counting only the distinct ones).
The product of its (nonzero) digits is 435456, while the sum is 46.
The spelling of 1004464972900 in words is "one trillion, four billion, four hundred sixty-four million, nine hundred seventy-two thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •