Base | Representation |
---|---|
bin | 10100101100101010… |
… | …010011100101000111 |
3 | 2010100211121111010021 |
4 | 110230222103211013 |
5 | 331003333433411 |
6 | 14113140040011 |
7 | 1414506640051 |
oct | 245452234507 |
9 | 63324544107 |
10 | 22224124231 |
11 | 9474a36521 |
12 | 4382993007 |
13 | 213240498a |
14 | 110b8428d1 |
15 | 8a1150a71 |
hex | 52ca93947 |
22224124231 has 12 divisors (see below), whose sum is σ = 23485111272. Its totient is φ = 21027744144.
The previous prime is 22224124213. The next prime is 22224124253. The reversal of 22224124231 is 13242142222.
It is not a de Polignac number, because 22224124231 - 217 = 22223993159 is a prime.
It is a super-2 number, since 2×222241242312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22224124196 and 22224124205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22224124631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 249096 + ... + 326338.
It is an arithmetic number, because the mean of its divisors is an integer number (1957092606).
Almost surely, 222224124231 is an apocalyptic number.
22224124231 is a deficient number, since it is larger than the sum of its proper divisors (1260987041).
22224124231 is an equidigital number, since it uses as much as digits as its factorization.
22224124231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78078 (or 78059 counting only the distinct ones).
The product of its digits is 3072, while the sum is 25.
Adding to 22224124231 its reverse (13242142222), we get a palindrome (35466266453).
The spelling of 22224124231 in words is "twenty-two billion, two hundred twenty-four million, one hundred twenty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •