Base | Representation |
---|---|
bin | 10101101000100101… |
… | …10001000100010000 |
3 | 1002222110012120212112 |
4 | 22310102301010100 |
5 | 142241334044130 |
6 | 5200304244452 |
7 | 560552525522 |
oct | 126422610420 |
9 | 32873176775 |
10 | 11614753040 |
11 | 4a20252960 |
12 | 2301910728 |
13 | 11313ba347 |
14 | 7c27b7a12 |
15 | 47ea23495 |
hex | 2b44b1110 |
11614753040 has 80 divisors (see below), whose sum is σ = 29491862400. Its totient is φ = 4218869760.
The previous prime is 11614753037. The next prime is 11614753057. The reversal of 11614753040 is 4035741611.
It is a tau number, because it is divible by the number of its divisors (80).
It is a junction number, because it is equal to n+sod(n) for n = 11614752988 and 11614753006.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 844136 + ... + 857784.
It is an arithmetic number, because the mean of its divisors is an integer number (368648280).
Almost surely, 211614753040 is an apocalyptic number.
11614753040 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 11614753040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14745931200).
11614753040 is an abundant number, since it is smaller than the sum of its proper divisors (17877109360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11614753040 is a wasteful number, since it uses less digits than its factorization.
11614753040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14640 (or 14634 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 32.
The spelling of 11614753040 in words is "eleven billion, six hundred fourteen million, seven hundred fifty-three thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •