Base | Representation |
---|---|
bin | 10101111011001111… |
… | …110000100010110110 |
3 | 2020202201111012220120 |
4 | 111323033300202312 |
5 | 341203344040141 |
6 | 14452034512410 |
7 | 1462256333610 |
oct | 257317604266 |
9 | 66681435816 |
10 | 23542565046 |
11 | 9a91189630 |
12 | 4690435706 |
13 | 22b25c8480 |
14 | 11d49a3db0 |
15 | 92bc84c66 |
hex | 57b3f08b6 |
23542565046 has 192 divisors, whose sum is σ = 64102510080. Its totient is φ = 5566763520.
The previous prime is 23542565021. The next prime is 23542565051. The reversal of 23542565046 is 64056524532.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 23542564989 and 23542565007.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 41375050 + ... + 41375618.
It is an arithmetic number, because the mean of its divisors is an integer number (333867240).
Almost surely, 223542565046 is an apocalyptic number.
23542565046 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 23542565046, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32051255040).
23542565046 is an abundant number, since it is smaller than the sum of its proper divisors (40559945034).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23542565046 is a wasteful number, since it uses less digits than its factorization.
23542565046 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 771 (or 688 counting only the distinct ones).
The product of its (nonzero) digits is 864000, while the sum is 42.
The spelling of 23542565046 in words is "twenty-three billion, five hundred forty-two million, five hundred sixty-five thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.908 sec. • engine limits •