Base | Representation |
---|---|
bin | 10100110001010011… |
… | …110011111000110011 |
3 | 2010120021100202001110 |
4 | 110301103303320303 |
5 | 331133320111311 |
6 | 14125003404403 |
7 | 1416444556401 |
oct | 246123637063 |
9 | 63507322043 |
10 | 22302113331 |
11 | 9504a63923 |
12 | 43a4b23703 |
13 | 214560c984 |
14 | 1117d44471 |
15 | 8a7e088a6 |
hex | 5314f3e33 |
22302113331 has 8 divisors (see below), whose sum is σ = 29744596224. Its totient is φ = 14863853000.
The previous prime is 22302113311. The next prime is 22302113347. The reversal of 22302113331 is 13331120322.
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 22302113331 - 25 = 22302113299 is a prime.
It is a super-2 number, since 2×223021133312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22302113298 and 22302113307.
It is not an unprimeable number, because it can be changed into a prime (22302113311) 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, 1043295 + ... + 1064456.
It is an arithmetic number, because the mean of its divisors is an integer number (3718074528).
Almost surely, 222302113331 is an apocalyptic number.
22302113331 is a deficient number, since it is larger than the sum of its proper divisors (7442482893).
22302113331 is a wasteful number, since it uses less digits than its factorization.
22302113331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2111281.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 22302113331 its reverse (13331120322), we get a palindrome (35633233653).
The spelling of 22302113331 in words is "twenty-two billion, three hundred two million, one hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •