Base | Representation |
---|---|
bin | 1010000000010101111100… |
… | …00011101010101000100100 |
3 | 2212220101000222120221122200 |
4 | 11000022332003222220210 |
5 | 10340440104321402322 |
6 | 114443330120254500 |
7 | 4430410226544012 |
oct | 500127603525044 |
9 | 85811028527580 |
10 | 22002011122212 |
11 | 70130007617a0 |
12 | 2574179011430 |
13 | c37a1c3b7a44 |
14 | 560c8dc5d8b2 |
15 | 2824c96c18ac |
hex | 1402be0eaa24 |
22002011122212 has 72 divisors (see below), whose sum is σ = 60686805204480. Its totient is φ = 6665672502720.
The previous prime is 22002011122211. The next prime is 22002011122237. The reversal of 22002011122212 is 21222111020022.
It is a happy number.
22002011122212 is a `hidden beast` number, since 220 + 0 + 201 + 11 + 22 + 212 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (22002011122211) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5032603 + ... + 8326530.
Almost surely, 222002011122212 is an apocalyptic number.
22002011122212 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
22002011122212 is an abundant number, since it is smaller than the sum of its proper divisors (38684794082268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22002011122212 is a wasteful number, since it uses less digits than its factorization.
22002011122212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13363313 (or 13363308 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 22002011122212 its reverse (21222111020022), we get a palindrome (43224122142234).
The spelling of 22002011122212 in words is "twenty-two trillion, two billion, eleven million, one hundred twenty-two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •