Base | Representation |
---|---|
bin | 1010000000010010110000… |
… | …00101000011110011001000 |
3 | 2212220012121202012200020120 |
4 | 11000021120011003303020 |
5 | 10340423103323231100 |
6 | 114442444241423240 |
7 | 4430316643206600 |
oct | 500113005036310 |
9 | 85805552180216 |
10 | 22000300211400 |
11 | 7012302a17115 |
12 | 257398003ab20 |
13 | c37808abb194 |
14 | 560b6a937c00 |
15 | 2824293b50a0 |
hex | 140258143cc8 |
22000300211400 has 288 divisors, whose sum is σ = 82785160607040. Its totient is φ = 4810003376640.
The previous prime is 22000300211353. The next prime is 22000300211443. The reversal of 22000300211400 is 411200300022.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 22000300211400.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 15591399 + ... + 16943798.
It is an arithmetic number, because the mean of its divisors is an integer number (287448474330).
Almost surely, 222000300211400 is an apocalyptic number.
22000300211400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22000300211400 is an abundant number, since it is smaller than the sum of its proper divisors (60784860395640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22000300211400 is a wasteful number, since it uses less digits than its factorization.
22000300211400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32535253 (or 32535237 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 22000300211400 its reverse (411200300022), we get a palindrome (22411500511422).
The spelling of 22000300211400 in words is "twenty-two trillion, three hundred million, two hundred eleven thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •