Base | Representation |
---|---|
bin | 1010000110111110111110… |
… | …01111110011110010000110 |
3 | 2220201012000221111222202110 |
4 | 11003133133033303302012 |
5 | 10403204423003021410 |
6 | 115140225150121450 |
7 | 4453036052431503 |
oct | 503373717636206 |
9 | 86635027458673 |
10 | 22230201220230 |
11 | 70a0859059863 |
12 | 25b04414b0286 |
13 | c533b6b22b93 |
14 | 56bd39c564aa |
15 | 2883d290c720 |
hex | 1437df3f3c86 |
22230201220230 has 64 divisors (see below), whose sum is σ = 53775739035648. Its totient is φ = 5881030686720.
The previous prime is 22230201220217. The next prime is 22230201220231. The reversal of 22230201220230 is 3202210203222.
It is a super-2 number, since 2×222302012202302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22230201220197 and 22230201220206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22230201220231) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 68307174 + ... + 68631846.
It is an arithmetic number, because the mean of its divisors is an integer number (840245922432).
Almost surely, 222230201220230 is an apocalyptic number.
22230201220230 is an abundant number, since it is smaller than the sum of its proper divisors (31545537815418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22230201220230 is a wasteful number, since it uses less digits than its factorization.
22230201220230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 342781.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 22230201220230 its reverse (3202210203222), we get a palindrome (25432411423452).
The spelling of 22230201220230 in words is "twenty-two trillion, two hundred thirty billion, two hundred one million, two hundred twenty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •