Base | Representation |
---|---|
bin | 10110101010000110… |
… | …11111000000100000 |
3 | 1011101202110021221122 |
4 | 23111003133000200 |
5 | 144403041120130 |
6 | 5331021111412 |
7 | 610305436400 |
oct | 132503370040 |
9 | 34352407848 |
10 | 12164395040 |
11 | 5182536046 |
12 | 24359b8568 |
13 | 11bb2338b5 |
14 | 8357b2800 |
15 | 4b2de52e5 |
hex | 2d50df020 |
12164395040 has 144 divisors (see below), whose sum is σ = 34509452544. Its totient is φ = 4036032000.
The previous prime is 12164395027. The next prime is 12164395049. The reversal of 12164395040 is 4059346121.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is not an unprimeable number, because it can be changed into a prime (12164395049) 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, 218015 + ... + 268065.
It is an arithmetic number, because the mean of its divisors is an integer number (239648976).
Almost surely, 212164395040 is an apocalyptic number.
12164395040 is a gapful number since it is divisible by the number (10) 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 12164395040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17254726272).
12164395040 is an abundant number, since it is smaller than the sum of its proper divisors (22345057504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12164395040 is a wasteful number, since it uses less digits than its factorization.
12164395040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50111 (or 50096 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 35.
The spelling of 12164395040 in words is "twelve billion, one hundred sixty-four million, three hundred ninety-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •