Base | Representation |
---|---|
bin | 10101111100110000… |
… | …100000110010010100 |
3 | 2020211111012210222120 |
4 | 111330300200302110 |
5 | 341231342202333 |
6 | 14454342255540 |
7 | 1463015041500 |
oct | 257460406224 |
9 | 66744183876 |
10 | 23567928468 |
11 | 9aa4532537 |
12 | 4698a275b0 |
13 | 22b7938c06 |
14 | 11d80c7300 |
15 | 92e0e4db3 |
hex | 57cc20c94 |
23567928468 has 72 divisors (see below), whose sum is σ = 64118521152. Its totient is φ = 6718070016.
The previous prime is 23567928421. The next prime is 23567928479. The reversal of 23567928468 is 86482976532.
It is a Smith number, since the sum of its digits (60) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 208321 + ... + 300887.
It is an arithmetic number, because the mean of its divisors is an integer number (890535016).
Almost surely, 223567928468 is an apocalyptic number.
23567928468 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 23567928468, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32059260576).
23567928468 is an abundant number, since it is smaller than the sum of its proper divisors (40550592684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23567928468 is a wasteful number, since it uses less digits than its factorization.
23567928468 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93021 (or 93012 counting only the distinct ones).
The product of its digits is 34836480, while the sum is 60.
The spelling of 23567928468 in words is "twenty-three billion, five hundred sixty-seven million, nine hundred twenty-eight thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •