Base | Representation |
---|---|
bin | 1010000000111011100101… |
… | …01010111111111100111100 |
3 | 2212222022012110102100010010 |
4 | 11000131302222333330330 |
5 | 10341303002111414322 |
6 | 114500511352343220 |
7 | 4432024112434101 |
oct | 500356252777474 |
9 | 85868173370103 |
10 | 22022221201212 |
11 | 7020631828221 |
12 | 25780793a4b10 |
13 | c398c046847b |
14 | 561c49dccaa8 |
15 | 282cadad820c |
hex | 140772abff3c |
22022221201212 has 96 divisors (see below), whose sum is σ = 55076906241280. Its totient is φ = 6827871697920.
The previous prime is 22022221201139. The next prime is 22022221201223. The reversal of 22022221201212 is 21210212222022.
It is a super-2 number, since 2×220222212012122 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6160308 + ... + 9055044.
Almost surely, 222022221201212 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22022221201212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27538453120640).
22022221201212 is an abundant number, since it is smaller than the sum of its proper divisors (33054685040068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22022221201212 is a wasteful number, since it uses less digits than its factorization.
22022221201212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2895371 (or 2895369 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 22022221201212 its reverse (21210212222022), we get a palindrome (43232433423234).
The spelling of 22022221201212 in words is "twenty-two trillion, twenty-two billion, two hundred twenty-one million, two hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •