Base | Representation |
---|---|
bin | 10101001111110000… |
… | …101111011111110000 |
3 | 2011212212201012000110 |
4 | 111033300233133300 |
5 | 333210112422000 |
6 | 14251414021320 |
7 | 1435220263620 |
oct | 251760573760 |
9 | 64785635013 |
10 | 22813014000 |
11 | 9747396087 |
12 | 4508047840 |
13 | 21c741056a |
14 | 1165b36880 |
15 | 8d7bc6850 |
hex | 54fc2f7f0 |
22813014000 has 640 divisors, whose sum is σ = 90251366400. Its totient is φ = 4839014400.
The previous prime is 22813013999. The next prime is 22813014041. The reversal of 22813014000 is 41031822.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 63545821 + ... + 63546179.
It is an arithmetic number, because the mean of its divisors is an integer number (141017760).
Almost surely, 222813014000 is an apocalyptic number.
22813014000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22813014000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45125683200).
22813014000 is an abundant number, since it is smaller than the sum of its proper divisors (67438352400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22813014000 is a wasteful number, since it uses less digits than its factorization.
22813014000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 498 (or 482 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 22813014000 its reverse (41031822), we get a palindrome (22854045822).
The spelling of 22813014000 in words is "twenty-two billion, eight hundred thirteen million, fourteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •