Base | Representation |
---|---|
bin | 10100101011011010… |
… | …100110100001111011 |
3 | 2010022101021222002010 |
4 | 110223122212201323 |
5 | 330433011332311 |
6 | 14111112141003 |
7 | 1414134225642 |
oct | 245332464173 |
9 | 63271258063 |
10 | 22203230331 |
11 | 9464165637 |
12 | 4377997763 |
13 | 212ac9a719 |
14 | 1108b64359 |
15 | 89e3c4da6 |
hex | 52b6a687b |
22203230331 has 8 divisors (see below), whose sum is σ = 29785929280. Its totient is φ = 14711342472.
The previous prime is 22203230321. The next prime is 22203230339. The reversal of 22203230331 is 13303230222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22203230331 - 26 = 22203230267 is a prime.
It is a super-2 number, since 2×222032303312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22203230298 and 22203230307.
It is not an unprimeable number, because it can be changed into a prime (22203230339) 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 7 ways as a sum of consecutive naturals, for example, 22702201 + ... + 22703178.
It is an arithmetic number, because the mean of its divisors is an integer number (3723241160).
Almost surely, 222203230331 is an apocalyptic number.
22203230331 is a deficient number, since it is larger than the sum of its proper divisors (7582698949).
22203230331 is a wasteful number, since it uses less digits than its factorization.
22203230331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45405545.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 22203230331 its reverse (13303230222), we get a palindrome (35506460553).
The spelling of 22203230331 in words is "twenty-two billion, two hundred three million, two hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •