Base | Representation |
---|---|
bin | 10110011011111111… |
… | …101101100100000000 |
3 | 2022012000100202002211 |
4 | 112123333231210000 |
5 | 343320023203111 |
6 | 15022343151504 |
7 | 1512010451314 |
oct | 263377554400 |
9 | 68160322084 |
10 | 24092006656 |
11 | a243345203 |
12 | 4804445594 |
13 | 236c3a1753 |
14 | 1247949b44 |
15 | 960117521 |
hex | 59bfed900 |
24092006656 has 81 divisors (see below), whose sum is σ = 49086609411. Its totient is φ = 11801382912.
The previous prime is 24092006651. The next prime is 24092006677. The reversal of 24092006656 is 65660029042.
The square root of 24092006656 is 155216.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 400640256 + 23691366400 = 20016^2 + 153920^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (24092006651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 221027530 + ... + 221027638.
Almost surely, 224092006656 is an apocalyptic number.
24092006656 is the 155216-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 24092006656
24092006656 is an abundant number, since it is smaller than the sum of its proper divisors (24994602755).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
24092006656 is an frugal number, since it uses more digits than its factorization.
24092006656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 412 (or 200 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 40.
The spelling of 24092006656 in words is "twenty-four billion, ninety-two million, six thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •