Base | Representation |
---|---|
bin | 11111110110001011010001… |
… | …00110101001101111101000 |
3 | 100011221220202111202120011020 |
4 | 33323011220212221233220 |
5 | 33134342342330133300 |
6 | 404535515421332440 |
7 | 20515405224304515 |
oct | 1773055046515750 |
9 | 304856674676136 |
10 | 70031196724200 |
11 | 20350077928818 |
12 | 7a30622107120 |
13 | 300cbb4cb721a |
14 | 1341756bca30c |
15 | 816a1370e8a0 |
hex | 3fb1689a9be8 |
70031196724200 has 192 divisors, whose sum is σ = 223008463925760. Its totient is φ = 18166648273920.
The previous prime is 70031196724187. The next prime is 70031196724219. The reversal of 70031196724200 is 242769113007.
70031196724200 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 112398729 + ... + 113020071.
It is an arithmetic number, because the mean of its divisors is an integer number (1161502416280).
Almost surely, 270031196724200 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 70031196724200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (111504231962880).
70031196724200 is an abundant number, since it is smaller than the sum of its proper divisors (152977267201560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70031196724200 is a wasteful number, since it uses less digits than its factorization.
70031196724200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 626476 (or 626467 counting only the distinct ones).
The product of its (nonzero) digits is 127008, while the sum is 42.
The spelling of 70031196724200 in words is "seventy trillion, thirty-one billion, one hundred ninety-six million, seven hundred twenty-four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •