Base | Representation |
---|---|
bin | 10101011000010101… |
… | …010011111000110000 |
3 | 2012020220022011222100 |
4 | 111120111103320300 |
5 | 334003421133333 |
6 | 14313552140400 |
7 | 1441614506310 |
oct | 253025237060 |
9 | 65226264870 |
10 | 22956817968 |
11 | 9810586137 |
12 | 4548237700 |
13 | 221b150176 |
14 | 117ac8b440 |
15 | 8e5630213 |
hex | 558553e30 |
22956817968 has 120 divisors (see below), whose sum is σ = 73476868608. Its totient is φ = 6554491776.
The previous prime is 22956817967. The next prime is 22956817973. The reversal of 22956817968 is 86971865922.
22956817968 is a `hidden beast` number, since 2 + 2 + 9 + 568 + 1 + 7 + 9 + 68 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is not an unprimeable number, because it can be changed into a prime (22956817967) 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, 1588471 + ... + 1602857.
Almost surely, 222956817968 is an apocalyptic number.
22956817968 is a gapful number since it is divisible by the number (28) 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 22956817968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36738434304).
22956817968 is an abundant number, since it is smaller than the sum of its proper divisors (50520050640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22956817968 is a wasteful number, since it uses less digits than its factorization.
22956817968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15991 (or 15982 counting only the distinct ones).
The product of its digits is 26127360, while the sum is 63.
The spelling of 22956817968 in words is "twenty-two billion, nine hundred fifty-six million, eight hundred seventeen thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •