Base | Representation |
---|---|
bin | 1011000111010111001110… |
… | …1000101011100100110010 |
3 | 1121021022212000010121211200 |
4 | 2301311303220223210302 |
5 | 3100212324213014302 |
6 | 41554150025552030 |
7 | 2400642540011652 |
oct | 261656350534462 |
9 | 47238760117750 |
10 | 12221122001202 |
11 | 3991a48847144 |
12 | 1454651045616 |
13 | 6a85a699b60a |
14 | 303710db0362 |
15 | 162d7589081c |
hex | b1d73a2b932 |
12221122001202 has 48 divisors (see below), whose sum is σ = 27321271391232. Its totient is φ = 3945929253120.
The previous prime is 12221122001141. The next prime is 12221122001237. The reversal of 12221122001202 is 20210022112221.
It is a happy number.
It is a super-4 number, since 4×122211220012024 (a number of 53 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 74380674 + ... + 74544797.
It is an arithmetic number, because the mean of its divisors is an integer number (569193153984).
Almost surely, 212221122001202 is an apocalyptic number.
12221122001202 is an abundant number, since it is smaller than the sum of its proper divisors (15100149390030).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12221122001202 is a wasteful number, since it uses less digits than its factorization.
12221122001202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148925623 (or 148925620 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 12221122001202 its reverse (20210022112221), we get a palindrome (32431144113423).
The spelling of 12221122001202 in words is "twelve trillion, two hundred twenty-one billion, one hundred twenty-two million, one thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •