Base | Representation |
---|---|
bin | 1001000110000101010100… |
… | …00000101000010111101000 |
3 | 2121211000001201110210102220 |
4 | 10203002222000220113220 |
5 | 10110140422311202443 |
6 | 110311550233554040 |
7 | 4132653045130104 |
oct | 443025200502750 |
9 | 77730051423386 |
10 | 20000220022248 |
11 | 6411055886004 |
12 | 22b0215275920 |
13 | b21021a5b60b |
14 | 4d2031572904 |
15 | 24a3b9347a83 |
hex | 1230aa0285e8 |
20000220022248 has 64 divisors (see below), whose sum is σ = 52261590528000. Its totient is φ = 6366235761600.
The previous prime is 20000220022247. The next prime is 20000220022249. The reversal of 20000220022248 is 84222002200002.
It is an interprime number because it is at equal distance from previous prime (20000220022247) and next prime (20000220022249).
It is a super-2 number, since 2×200002200222482 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (20000220022247) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29913328 + ... + 30574623.
It is an arithmetic number, because the mean of its divisors is an integer number (816587352000).
Almost surely, 220000220022248 is an apocalyptic number.
It is an amenable number.
20000220022248 is an abundant number, since it is smaller than the sum of its proper divisors (32261370505752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20000220022248 is a wasteful number, since it uses less digits than its factorization.
20000220022248 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60488582 (or 60488578 counting only the distinct ones).
The product of its (nonzero) digits is 2048, while the sum is 24.
The spelling of 20000220022248 in words is "twenty trillion, two hundred twenty million, twenty-two thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •