Base | Representation |
---|---|
bin | 101100001010… |
… | …0101011010100 |
3 | 1121120022110000 |
4 | 1120110223110 |
5 | 21411401424 |
6 | 2144131300 |
7 | 400541343 |
oct | 130245324 |
9 | 47508400 |
10 | 23153364 |
11 | 12084513 |
12 | 7906b30 |
13 | 4a48820 |
14 | 3109b5a |
15 | 20753c9 |
hex | 1614ad4 |
23153364 has 120 divisors (see below), whose sum is σ = 68302080. Its totient is φ = 6785856.
The previous prime is 23153359. The next prime is 23153401. The reversal of 23153364 is 46335132.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 39 ways as a sum of consecutive naturals, for example, 96757 + ... + 96995.
It is an arithmetic number, because the mean of its divisors is an integer number (569184).
Almost surely, 223153364 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 23153364, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34151040).
23153364 is an abundant number, since it is smaller than the sum of its proper divisors (45148716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23153364 is a wasteful number, since it uses less digits than its factorization.
23153364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291 (or 280 counting only the distinct ones).
The product of its digits is 6480, while the sum is 27.
The square root of 23153364 is about 4811.7942599409. The cubic root of 23153364 is about 285.0173950601.
Adding to 23153364 its reverse (46335132), we get a palindrome (69488496).
The spelling of 23153364 in words is "twenty-three million, one hundred fifty-three thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •