Base | Representation |
---|---|
bin | 1010000110111111000001… |
… | …00011010100011101011110 |
3 | 2220201012002110201012122212 |
4 | 11003133200203110131132 |
5 | 10403204444104041110 |
6 | 115140231251240422 |
7 | 4453036436500133 |
oct | 503374043243536 |
9 | 86635073635585 |
10 | 22230223112030 |
11 | 70a086a45145a |
12 | 25b04488a9112 |
13 | c533bb5193cb |
14 | 56bd3cb1458a |
15 | 2883d47d3e05 |
hex | 1437e08d475e |
22230223112030 has 32 divisors (see below), whose sum is σ = 40242810731040. Its totient is φ = 8841343674240.
The previous prime is 22230223112029. The next prime is 22230223112033. The reversal of 22230223112030 is 3021132203222.
It is a super-2 number, since 2×222302231120302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22230223111987 and 22230223112005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22230223112033) 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 15 ways as a sum of consecutive naturals, for example, 14140820 + ... + 15634040.
It is an arithmetic number, because the mean of its divisors is an integer number (1257587835345).
Almost surely, 222230223112030 is an apocalyptic number.
22230223112030 is a deficient number, since it is larger than the sum of its proper divisors (18012587619010).
22230223112030 is a wasteful number, since it uses less digits than its factorization.
22230223112030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1501724.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 22230223112030 its reverse (3021132203222), we get a palindrome (25251355315252).
The spelling of 22230223112030 in words is "twenty-two trillion, two hundred thirty billion, two hundred twenty-three million, one hundred twelve thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •