Base | Representation |
---|---|
bin | 10101001000001111… |
… | …10010100101101000 |
3 | 1002021112200110200000 |
4 | 22210013302211220 |
5 | 141212410041412 |
6 | 5113333143000 |
7 | 551046436215 |
oct | 124407624550 |
9 | 32245613600 |
10 | 11343440232 |
11 | 48a10925a3 |
12 | 2246a8aa60 |
13 | 10ba124b17 |
14 | 798750b0c |
15 | 465cce4dc |
hex | 2a41f2968 |
11343440232 has 48 divisors (see below), whose sum is σ = 31859667840. Its totient is φ = 3781146096.
The previous prime is 11343440203. The next prime is 11343440261. The reversal of 11343440232 is 23204434311.
It is an interprime number because it is at equal distance from previous prime (11343440203) and next prime (11343440261).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 11343440196 and 11343440205.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2915608 + ... + 2919495.
It is an arithmetic number, because the mean of its divisors is an integer number (663743080).
Almost surely, 211343440232 is an apocalyptic number.
11343440232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11343440232 is an abundant number, since it is smaller than the sum of its proper divisors (20516227608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11343440232 is an equidigital number, since it uses as much as digits as its factorization.
11343440232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5835124 (or 5835108 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 11343440232 its reverse (23204434311), we get a palindrome (34547874543).
The spelling of 11343440232 in words is "eleven billion, three hundred forty-three million, four hundred forty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •