Base | Representation |
---|---|
bin | 11111001000010011… |
… | …11000000100000110 |
3 | 1121010201212221000100 |
4 | 33210021320010012 |
5 | 233211422233240 |
6 | 11402215024530 |
7 | 1131104400300 |
oct | 174411700406 |
9 | 47121787010 |
10 | 16712696070 |
11 | 70a6976a14 |
12 | 32a506b146 |
13 | 176461c395 |
14 | b47892970 |
15 | 67c374e30 |
hex | 3e4278106 |
16712696070 has 144 divisors (see below), whose sum is σ = 50643532368. Its totient is φ = 3812780160.
The previous prime is 16712696069. The next prime is 16712696087. The reversal of 16712696070 is 7069621761.
It is a happy number.
16712696070 is a `hidden beast` number, since 16 + 7 + 1 + 26 + 9 + 607 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 2514792 + ... + 2521428.
It is an arithmetic number, because the mean of its divisors is an integer number (351691197).
Almost surely, 216712696070 is an apocalyptic number.
16712696070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 16712696070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25321766184).
16712696070 is an abundant number, since it is smaller than the sum of its proper divisors (33930836298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16712696070 is a wasteful number, since it uses less digits than its factorization.
16712696070 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7235 (or 7225 counting only the distinct ones).
The product of its (nonzero) digits is 190512, while the sum is 45.
The spelling of 16712696070 in words is "sixteen billion, seven hundred twelve million, six hundred ninety-six thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •