Base | Representation |
---|---|
bin | 101100110001… |
… | …1100101011100 |
3 | 1122011201210200 |
4 | 1121203211130 |
5 | 22002222242 |
6 | 2155103500 |
7 | 403355550 |
oct | 131434534 |
9 | 48151720 |
10 | 23476572 |
11 | 12285329 |
12 | 7a41b90 |
13 | 4b2c982 |
14 | 3191860 |
15 | 20db04c |
hex | 166395c |
23476572 has 72 divisors (see below), whose sum is σ = 69014400. Its totient is φ = 6589728.
The previous prime is 23476553. The next prime is 23476577. The reversal of 23476572 is 27567432.
It is a happy number.
It is a super-2 number, since 2×234765722 = 1102298865742368, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23476577) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14079 + ... + 15657.
Almost surely, 223476572 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 23476572, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34507200).
23476572 is an abundant number, since it is smaller than the sum of its proper divisors (45537828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23476572 is a wasteful number, since it uses less digits than its factorization.
23476572 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1655 (or 1650 counting only the distinct ones).
The product of its digits is 70560, while the sum is 36.
The square root of 23476572 is about 4845.2628411676. The cubic root of 23476572 is about 286.3374991055.
The spelling of 23476572 in words is "twenty-three million, four hundred seventy-six thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •