Base | Representation |
---|---|
bin | 100000101010000001… |
… | …000110101000000000 |
3 | 10100111201100211111011 |
4 | 200222001012220000 |
5 | 1033303023430340 |
6 | 24035233330304 |
7 | 2350635532462 |
oct | 405201065000 |
9 | 110451324434 |
10 | 35064670720 |
11 | 13964102112 |
12 | 6967106994 |
13 | 33ca747891 |
14 | 19a8d42132 |
15 | da35a70ea |
hex | 82a046a00 |
35064670720 has 80 divisors (see below), whose sum is σ = 84160327680. Its totient is φ = 14011305984.
The previous prime is 35064670709. The next prime is 35064670763. The reversal of 35064670720 is 2707646053.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×350646707202 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2653249 + ... + 2666431.
It is an arithmetic number, because the mean of its divisors is an integer number (1052004096).
Almost surely, 235064670720 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 35064670720, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42080163840).
35064670720 is an abundant number, since it is smaller than the sum of its proper divisors (49095656960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
35064670720 is a wasteful number, since it uses less digits than its factorization.
35064670720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14245 (or 14229 counting only the distinct ones).
The product of its (nonzero) digits is 211680, while the sum is 40.
The spelling of 35064670720 in words is "thirty-five billion, sixty-four million, six hundred seventy thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •