Base | Representation |
---|---|
bin | 1001010011100101111111… |
… | …1010010100010110100111 |
3 | 1100020012011002102121212220 |
4 | 2110321133322110112213 |
5 | 2320121042113103221 |
6 | 33432341215443423 |
7 | 2104152660226044 |
oct | 224713772242647 |
9 | 40205132377786 |
10 | 10232221222311 |
11 | 3295508143470 |
12 | 11930a6226573 |
13 | 592b81a919ca |
14 | 27535665c1cb |
15 | 12b26c0010c6 |
hex | 94e5fe945a7 |
10232221222311 has 32 divisors (see below), whose sum is σ = 16030897428480. Its totient is φ = 5738332572000.
The previous prime is 10232221222291. The next prime is 10232221222337. The reversal of 10232221222311 is 11322212223201.
It is not a de Polignac number, because 10232221222311 - 231 = 10230073738663 is a prime.
It is a super-2 number, since 2×102322212223112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10232221224311) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 189732715 + ... + 189786636.
It is an arithmetic number, because the mean of its divisors is an integer number (500965544640).
Almost surely, 210232221222311 is an apocalyptic number.
10232221222311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10232221222311 is a deficient number, since it is larger than the sum of its proper divisors (5798676206169).
10232221222311 is a wasteful number, since it uses less digits than its factorization.
10232221222311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379519427.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 10232221222311 its reverse (11322212223201), we get a palindrome (21554433445512).
The spelling of 10232221222311 in words is "ten trillion, two hundred thirty-two billion, two hundred twenty-one million, two hundred twenty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •