Base | Representation |
---|---|
bin | 10101101000000011… |
… | …00010000100010000 |
3 | 1002222010201001111100 |
4 | 22310001202010100 |
5 | 142234210011102 |
6 | 5200023344400 |
7 | 560466241035 |
oct | 126401420420 |
9 | 32863631440 |
10 | 11610235152 |
11 | 4a1874756a |
12 | 23002b2100 |
13 | 1130497b39 |
14 | 7c1d5d38c |
15 | 47e42ea1c |
hex | 2b4062110 |
11610235152 has 120 divisors (see below), whose sum is σ = 34246424160. Its totient is φ = 3661701120.
The previous prime is 11610235129. The next prime is 11610235183. The reversal of 11610235152 is 25153201611.
11610235152 is a `hidden beast` number, since 1 + 1 + 610 + 2 + 35 + 15 + 2 = 666.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2588752 + ... + 2593232.
It is an arithmetic number, because the mean of its divisors is an integer number (285386868).
Almost surely, 211610235152 is an apocalyptic number.
11610235152 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 11610235152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17123212080).
11610235152 is an abundant number, since it is smaller than the sum of its proper divisors (22636189008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11610235152 is a wasteful number, since it uses less digits than its factorization.
11610235152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5461 (or 5452 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
Adding to 11610235152 its reverse (25153201611), we get a palindrome (36763436763).
The spelling of 11610235152 in words is "eleven billion, six hundred ten million, two hundred thirty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •