Base | Representation |
---|---|
bin | 100000111110000000… |
… | …0011010111000000000 |
3 | 20202202011121200220000 |
4 | 1001330000122320000 |
5 | 2124444242232400 |
6 | 52305224520000 |
7 | 5054326513134 |
oct | 1017400327000 |
9 | 222664550800 |
10 | 70799961600 |
11 | 28031807065 |
12 | 1187a920000 |
13 | 68a40b5c04 |
14 | 35d8d713c4 |
15 | 1c9597b600 |
hex | 107c01ae00 |
70799961600 has 600 divisors, whose sum is σ = 273520819440. Its totient is φ = 18053038080.
The previous prime is 70799961593. The next prime is 70799961601. The reversal of 70799961600 is 616999707.
It is a tau number, because it is divible by the number of its divisors (600).
It is a super-2 number, since 2×707999616002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (70799961601) by changing a digit.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 23844916 + ... + 23847884.
Almost surely, 270799961600 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 70799961600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136760409720).
70799961600 is an abundant number, since it is smaller than the sum of its proper divisors (202720857840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70799961600 is a wasteful number, since it uses less digits than its factorization.
70799961600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3032 (or 3002 counting only the distinct ones).
The product of its (nonzero) digits is 1285956, while the sum is 54.
The spelling of 70799961600 in words is "seventy billion, seven hundred ninety-nine million, nine hundred sixty-one thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •