Base | Representation |
---|---|
bin | 10000000010111111000011… |
… | …111110111010111100000000 |
3 | 100020212210120010121120201210 |
4 | 100002333003332322330000 |
5 | 33222240314244121112 |
6 | 410033111115530120 |
7 | 20602536632361645 |
oct | 2002770376727400 |
9 | 306783503546653 |
10 | 70573895692032 |
11 | 2053a248295787 |
12 | 7ab983aa59940 |
13 | 304c1223cc225 |
14 | 135db1ac21dcc |
15 | 825bc7c58b3c |
hex | 402fc3fbaf00 |
70573895692032 has 288 divisors, whose sum is σ = 191629836921600. Its totient is φ = 23053544718336.
The previous prime is 70573895691989. The next prime is 70573895692067. The reversal of 70573895692032 is 23029659837507.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12484323318 + ... + 12484328970.
It is an arithmetic number, because the mean of its divisors is an integer number (665381378200).
Almost surely, 270573895692032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 70573895692032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (95814918460800).
70573895692032 is an abundant number, since it is smaller than the sum of its proper divisors (121055941229568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70573895692032 is a wasteful number, since it uses less digits than its factorization.
70573895692032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7303 (or 7289 counting only the distinct ones).
The product of its (nonzero) digits is 171460800, while the sum is 66.
The spelling of 70573895692032 in words is "seventy trillion, five hundred seventy-three billion, eight hundred ninety-five million, six hundred ninety-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •