Base | Representation |
---|---|
bin | 1010000010000110111010… |
… | …1000110111100011101010 |
3 | 1110001120210111202112100220 |
4 | 2200201232220313203222 |
5 | 2421214132022120320 |
6 | 35243420221510510 |
7 | 2215662460531005 |
oct | 240415650674352 |
9 | 43046714675326 |
10 | 11031332223210 |
11 | 35733a84a9a62 |
12 | 12a1b42a12436 |
13 | 6203337c6cc0 |
14 | 2a1cc28cc53c |
15 | 141e3c23ae40 |
hex | a086ea378ea |
11031332223210 has 128 divisors (see below), whose sum is σ = 28569513176064. Its totient is φ = 2709906554880.
The previous prime is 11031332223187. The next prime is 11031332223227. The reversal of 11031332223210 is 1232223313011.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1270740070 + ... + 1270748750.
It is an arithmetic number, because the mean of its divisors is an integer number (223199321688).
Almost surely, 211031332223210 is an apocalyptic number.
11031332223210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 11031332223210, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14284756588032).
11031332223210 is an abundant number, since it is smaller than the sum of its proper divisors (17538180952854).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11031332223210 is a wasteful number, since it uses less digits than its factorization.
11031332223210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14928.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 11031332223210 its reverse (1232223313011), we get a palindrome (12263555536221).
The spelling of 11031332223210 in words is "eleven trillion, thirty-one billion, three hundred thirty-two million, two hundred twenty-three thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •