Base | Representation |
---|---|
bin | 11101111011111110… |
… | …00001001000111100 |
3 | 1112111002220012221200 |
4 | 32331333001020330 |
5 | 230404003043302 |
6 | 11214501255500 |
7 | 1106200266354 |
oct | 167577011074 |
9 | 45432805850 |
10 | 16072315452 |
11 | 68a8448536 |
12 | 3146704590 |
13 | 1691a5593b |
14 | ac67d7b64 |
15 | 64102c81c |
hex | 3bdfc123c |
16072315452 has 72 divisors (see below), whose sum is σ = 42664011936. Its totient is φ = 5091825024.
The previous prime is 16072315447. The next prime is 16072315453. The reversal of 16072315452 is 25451327061.
16072315452 is a `hidden beast` number, since 1 + 607 + 2 + 3 + 1 + 5 + 45 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16072315453) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 68178 + ... + 191814.
Almost surely, 216072315452 is an apocalyptic number.
16072315452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16072315452, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21332005968).
16072315452 is an abundant number, since it is smaller than the sum of its proper divisors (26591696484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16072315452 is a wasteful number, since it uses less digits than its factorization.
16072315452 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 123827 (or 123822 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 36.
The spelling of 16072315452 in words is "sixteen billion, seventy-two million, three hundred fifteen thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.240 sec. • engine limits •