Base | Representation |
---|---|
bin | 10000000000011101110… |
… | …001110010110100001000 |
3 | 10220011022200011210222220 |
4 | 100000131301302310020 |
5 | 121010310333021412 |
6 | 2201201014014040 |
7 | 142321206045411 |
oct | 20003561626410 |
9 | 3804280153886 |
10 | 1100011220232 |
11 | 39456a724a11 |
12 | 159233647320 |
13 | 7c966206372 |
14 | 3b352b88808 |
15 | 1d93196a68c |
hex | 1001dc72d08 |
1100011220232 has 16 divisors (see below), whose sum is σ = 2750028050640. Its totient is φ = 366670406736.
The previous prime is 1100011220183. The next prime is 1100011220233. The reversal of 1100011220232 is 2320221100011.
It is a super-2 number, since 2×11000112202322 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1100011220233) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22916900398 + ... + 22916900445.
It is an arithmetic number, because the mean of its divisors is an integer number (171876753165).
Almost surely, 21100011220232 is an apocalyptic number.
1100011220232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1100011220232 is an abundant number, since it is smaller than the sum of its proper divisors (1650016830408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100011220232 is a wasteful number, since it uses less digits than its factorization.
1100011220232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45833800852 (or 45833800848 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1100011220232 its reverse (2320221100011), we get a palindrome (3420232320243).
The spelling of 1100011220232 in words is "one trillion, one hundred billion, eleven million, two hundred twenty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •