Base | Representation |
---|---|
bin | 10101101000001100… |
… | …01111110101111110 |
3 | 1002222020000212002000 |
4 | 22310012033311332 |
5 | 142240014034410 |
6 | 5200110043130 |
7 | 560512606542 |
oct | 126406176576 |
9 | 32866025060 |
10 | 11611471230 |
11 | 4a19411217 |
12 | 23007a94a6 |
13 | 113080b648 |
14 | 7c21a1a22 |
15 | 47e5c5dc0 |
hex | 2b418fd7e |
11611471230 has 64 divisors (see below), whose sum is σ = 30999862080. Its totient is φ = 3092798592.
The previous prime is 11611471181. The next prime is 11611471243. The reversal of 11611471230 is 3217411611.
11611471230 is a `hidden beast` number, since 1 + 1 + 611 + 4 + 7 + 12 + 30 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11611471194 and 11611471203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 212272 + ... + 261308.
It is an arithmetic number, because the mean of its divisors is an integer number (484372845).
Almost surely, 211611471230 is an apocalyptic number.
11611471230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11611471230 is an abundant number, since it is smaller than the sum of its proper divisors (19388390850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11611471230 is a wasteful number, since it uses less digits than its factorization.
11611471230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49930 (or 49924 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
Adding to 11611471230 its reverse (3217411611), we get a palindrome (14828882841).
The spelling of 11611471230 in words is "eleven billion, six hundred eleven million, four hundred seventy-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •