Base | Representation |
---|---|
bin | 1010000111000010111000… |
… | …10110011001101011101011 |
3 | 2220201101110012221010222111 |
4 | 11003201130112121223223 |
5 | 10403223222311202311 |
6 | 115141213324303151 |
7 | 4453142056552456 |
oct | 503413426315353 |
9 | 86641405833874 |
10 | 22232300100331 |
11 | 70a17358a2512 |
12 | 25b09283a1ab7 |
13 | c5365c90b079 |
14 | 56c0988d049d |
15 | 2884a6d02d21 |
hex | 14385c599aeb |
22232300100331 has 32 divisors (see below), whose sum is σ = 24167586050496. Its totient is φ = 20374115328000.
The previous prime is 22232300100251. The next prime is 22232300100343. The reversal of 22232300100331 is 13300100323222.
It is a cyclic number.
It is not a de Polignac number, because 22232300100331 - 219 = 22232299576043 is a prime.
It is a super-2 number, since 2×222323001003312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22232300101331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 94916821 + ... + 95150761.
It is an arithmetic number, because the mean of its divisors is an integer number (755237064078).
Almost surely, 222232300100331 is an apocalyptic number.
22232300100331 is a deficient number, since it is larger than the sum of its proper divisors (1935285950165).
22232300100331 is a wasteful number, since it uses less digits than its factorization.
22232300100331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234943.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 22232300100331 its reverse (13300100323222), we get a palindrome (35532400423553).
The spelling of 22232300100331 in words is "twenty-two trillion, two hundred thirty-two billion, three hundred million, one hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •