Base | Representation |
---|---|
bin | 10101011101101000… |
… | …010000000000000000 |
3 | 2012111002111021111021 |
4 | 111131220100000000 |
5 | 334144142400424 |
6 | 14330444355224 |
7 | 1444043644651 |
oct | 253550200000 |
9 | 65432437437 |
10 | 23045668864 |
11 | 9856752129 |
12 | 4571b45b14 |
13 | 223368c06a |
14 | 11889b9528 |
15 | 8ed3314e4 |
hex | 55da10000 |
23045668864 has 51 divisors (see below), whose sum is σ = 46168842253. Its totient is φ = 11503403008.
The previous prime is 23045668861. The next prime is 23045668883. The reversal of 23045668864 is 46886654032.
The square root of 23045668864 is 151808.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 14170521600 + 8875147264 = 119040^2 + 94208^2 .
It is a super-2 number, since 2×230456688642 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23045668861) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 38862552 + ... + 38863144.
Almost surely, 223045668864 is an apocalyptic number.
23045668864 is the 151808-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23045668864
23045668864 is an abundant number, since it is smaller than the sum of its proper divisors (23123173389).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23045668864 is an frugal number, since it uses more digits than its factorization.
23045668864 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1218 (or 595 counting only the distinct ones).
The product of its (nonzero) digits is 6635520, while the sum is 52.
The spelling of 23045668864 in words is "twenty-three billion, forty-five million, six hundred sixty-eight thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •