Base | Representation |
---|---|
bin | 10100110011000010… |
… | …011101100111100111 |
3 | 2010122021221102212100 |
4 | 110303002131213213 |
5 | 331213231320403 |
6 | 14131521223143 |
7 | 1420246250265 |
oct | 246302354747 |
9 | 63567842770 |
10 | 22331120103 |
11 | 951a376066 |
12 | 43b2791ab3 |
13 | 214b627846 |
14 | 111bb35435 |
15 | 8aa7382a3 |
hex | 53309d9e7 |
22331120103 has 24 divisors (see below), whose sum is σ = 33327066240. Its totient is φ = 14393983680.
The previous prime is 22331120093. The next prime is 22331120113. The reversal of 22331120103 is 30102113322.
It is an interprime number because it is at equal distance from previous prime (22331120093) and next prime (22331120113).
It is not a de Polignac number, because 22331120103 - 218 = 22330857959 is a prime.
It is a super-2 number, since 2×223311201032 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22331120113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 273325 + ... + 345497.
It is an arithmetic number, because the mean of its divisors is an integer number (1388627760).
Almost surely, 222331120103 is an apocalyptic number.
22331120103 is a deficient number, since it is larger than the sum of its proper divisors (10995946137).
22331120103 is a wasteful number, since it uses less digits than its factorization.
22331120103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73319 (or 73316 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 22331120103 its reverse (30102113322), we get a palindrome (52433233425).
The spelling of 22331120103 in words is "twenty-two billion, three hundred thirty-one million, one hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •