Base | Representation |
---|---|
bin | 10101011001000011… |
… | …100100100101101000 |
3 | 2012021202010022010200 |
4 | 111121003210211220 |
5 | 334020022220000 |
6 | 14315104112200 |
7 | 1442122545141 |
oct | 253103444550 |
9 | 65252108120 |
10 | 22968945000 |
11 | 9817409381 |
12 | 4550305660 |
13 | 2220807c21 |
14 | 117c726ac8 |
15 | 8e6728500 |
hex | 5590e4968 |
22968945000 has 240 divisors, whose sum is σ = 78439844340. Its totient is φ = 6069504000.
The previous prime is 22968944969. The next prime is 22968945001. The reversal of 22968945000 is 54986922.
It can be written as a sum of positive squares in 10 ways, for example, as 15651511236 + 7317433764 = 125106^2 + 85542^2 .
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (22968945001) by changing a digit.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 5082742 + ... + 5087258.
Almost surely, 222968945000 is an apocalyptic number.
22968945000 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 22968945000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39219922170).
22968945000 is an abundant number, since it is smaller than the sum of its proper divisors (55470899340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22968945000 is a wasteful number, since it uses less digits than its factorization.
22968945000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4662 (or 4640 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 45.
The spelling of 22968945000 in words is "twenty-two billion, nine hundred sixty-eight million, nine hundred forty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •