Base | Representation |
---|---|
bin | 1010000011110010010010… |
… | …10110000101110110011111 |
3 | 2220022200101120202101222211 |
4 | 11001321021112011312133 |
5 | 10344404344344233203 |
6 | 115013533041021251 |
7 | 4442065645355422 |
oct | 501711126056637 |
9 | 86280346671884 |
10 | 22120312102303 |
11 | 7059198563028 |
12 | 2593093924827 |
13 | c45c235a998c |
14 | 5668b36979b9 |
15 | 285600418c6d |
hex | 141e49585d9f |
22120312102303 has 8 divisors (see below), whose sum is σ = 22838196142080. Its totient is φ = 21402698411640.
The previous prime is 22120312102289. The next prime is 22120312102373. The reversal of 22120312102303 is 30320121302122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22120312102303 - 25 = 22120312102271 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22120312102373) 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 7 ways as a sum of consecutive naturals, for example, 67420975 + ... + 67748272.
It is an arithmetic number, because the mean of its divisors is an integer number (2854774517760).
Almost surely, 222120312102303 is an apocalyptic number.
22120312102303 is a deficient number, since it is larger than the sum of its proper divisors (717884039777).
22120312102303 is a wasteful number, since it uses less digits than its factorization.
22120312102303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135174557.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 22120312102303 its reverse (30320121302122), we get a palindrome (52440433404425).
The spelling of 22120312102303 in words is "twenty-two trillion, one hundred twenty billion, three hundred twelve million, one hundred two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •