Base | Representation |
---|---|
bin | 1010000010000110100000… |
… | …0100110111001100010000 |
3 | 1110001120111211120202211212 |
4 | 2200201220010313030100 |
5 | 2421213420330334412 |
6 | 35243401245555252 |
7 | 2215656652632665 |
oct | 240415004671420 |
9 | 43046454522755 |
10 | 11031222121232 |
11 | 3573351338795 |
12 | 12a1b11b75b28 |
13 | 620316a573c1 |
14 | 2a1cb202ba6c |
15 | 141e3273d222 |
hex | a0868137310 |
11031222121232 has 20 divisors (see below), whose sum is σ = 22630227734556. Its totient is φ = 5191163351040.
The previous prime is 11031222121169. The next prime is 11031222121243. The reversal of 11031222121232 is 23212122213011.
It can be written as a sum of positive squares in 2 ways, for example, as 8825272381696 + 2205949739536 = 2970736^2 + 1485244^2 .
It is a super-2 number, since 2×110312221212322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11031222121198 and 11031222121207.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20277981569 + ... + 20277982112.
Almost surely, 211031222121232 is an apocalyptic number.
It is an amenable number.
11031222121232 is an abundant number, since it is smaller than the sum of its proper divisors (11599005613324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11031222121232 is a wasteful number, since it uses less digits than its factorization.
11031222121232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40555963706 (or 40555963700 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 11031222121232 its reverse (23212122213011), we get a palindrome (34243344334243).
The spelling of 11031222121232 in words is "eleven trillion, thirty-one billion, two hundred twenty-two million, one hundred twenty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.961 sec. • engine limits •