Base | Representation |
---|---|
bin | 101100100011… |
… | …0010100111000 |
3 | 1121221122102000 |
4 | 1121012110320 |
5 | 21434403403 |
6 | 2152341000 |
7 | 402346263 |
oct | 131062470 |
9 | 47848360 |
10 | 23356728 |
11 | 1220328a |
12 | 79a4760 |
13 | 4aba265 |
14 | 315dcda |
15 | 20b57a3 |
hex | 1646538 |
23356728 has 64 divisors (see below), whose sum is σ = 65836800. Its totient is φ = 7670880.
The previous prime is 23356703. The next prime is 23356769. The reversal of 23356728 is 82765332.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 23356692 and 23356701.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14575 + ... + 16097.
It is an arithmetic number, because the mean of its divisors is an integer number (1028700).
Almost surely, 223356728 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23356728, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32918400).
23356728 is an abundant number, since it is smaller than the sum of its proper divisors (42480072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23356728 is a wasteful number, since it uses less digits than its factorization.
23356728 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1609 (or 1599 counting only the distinct ones).
The product of its digits is 60480, while the sum is 36.
The square root of 23356728 is about 4832.8798867756. The cubic root of 23356728 is about 285.8494325398.
The spelling of 23356728 in words is "twenty-three million, three hundred fifty-six thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •