Base | Representation |
---|---|
bin | 10111100110100100… |
… | …00001000000000000 |
3 | 1012201002200221200000 |
4 | 23303102001000000 |
5 | 201422402131033 |
6 | 5453214400000 |
7 | 626004102144 |
oct | 136322010000 |
9 | 35632627600 |
10 | 12671520768 |
11 | 541281a115 |
12 | 2557800000 |
13 | 126c3121aa |
14 | 882ca1224 |
15 | 4e26b9a13 |
hex | 2f3481000 |
12671520768 has 312 divisors, whose sum is σ = 39356116800. Its totient is φ = 4068900864.
The previous prime is 12671520761. The next prime is 12671520773. The reversal of 12671520768 is 86702517621.
12671520768 is a `hidden beast` number, since 1 + 2 + 67 + 1 + 520 + 7 + 68 = 666.
It is not an unprimeable number, because it can be changed into a prime (12671520761) 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, 28864293 + ... + 28864731.
It is an arithmetic number, because the mean of its divisors is an integer number (126141400).
Almost surely, 212671520768 is an apocalyptic number.
12671520768 is a gapful number since it is divisible by the number (18) 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 12671520768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19678058400).
12671520768 is an abundant number, since it is smaller than the sum of its proper divisors (26684596032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12671520768 is an frugal number, since it uses more digits than its factorization.
12671520768 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 507 (or 473 counting only the distinct ones).
The product of its (nonzero) digits is 282240, while the sum is 45.
The spelling of 12671520768 in words is "twelve billion, six hundred seventy-one million, five hundred twenty thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •