Base | Representation |
---|---|
bin | 11101110011011011… |
… | …11000101110010000 |
3 | 1112022010011120111200 |
4 | 32321231320232100 |
5 | 230232140400124 |
6 | 11203422511200 |
7 | 1104340560543 |
oct | 167155705620 |
9 | 45263146450 |
10 | 16000715664 |
11 | 6870a9455a |
12 | 3126735500 |
13 | 167cc76bbb |
14 | abb0ba85a |
15 | 639ad7bc9 |
hex | 3b9b78b90 |
16000715664 has 120 divisors (see below), whose sum is σ = 46582044600. Its totient is φ = 5120962560.
The previous prime is 16000715609. The next prime is 16000715677. The reversal of 16000715664 is 46651700061.
It can be written as a sum of positive squares in 4 ways, for example, as 2145542400 + 13855173264 = 46320^2 + 117708^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 745272 + ... + 766440.
It is an arithmetic number, because the mean of its divisors is an integer number (388183705).
Almost surely, 216000715664 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 16000715664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23291022300).
16000715664 is an abundant number, since it is smaller than the sum of its proper divisors (30581328936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16000715664 is a wasteful number, since it uses less digits than its factorization.
16000715664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21393 (or 21384 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The spelling of 16000715664 in words is "sixteen billion, seven hundred fifteen thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •