Base | Representation |
---|---|
bin | 10110010011010110… |
… | …001011001111101001 |
3 | 2021210220022120211011 |
4 | 112103112023033221 |
5 | 343020401303312 |
6 | 15000121103521 |
7 | 1505266203214 |
oct | 262326131751 |
9 | 67726276734 |
10 | 23946900457 |
11 | a179445827 |
12 | 4783927ba1 |
13 | 23482c71ac |
14 | 123257677b |
15 | 952502da7 |
hex | 59358b3e9 |
23946900457 has 8 divisors (see below), whose sum is σ = 24054913800. Its totient is φ = 23839002624.
The previous prime is 23946900443. The next prime is 23946900521. The reversal of 23946900457 is 75400964932.
It can be written as a sum of positive squares in 4 ways, for example, as 10050263001 + 13896637456 = 100251^2 + 117884^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23946900457 - 219 = 23946376169 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23946900457.
It is not an unprimeable number, because it can be changed into a prime (23946900407) 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 7 ways as a sum of consecutive naturals, for example, 401019 + ... + 456847.
It is an arithmetic number, because the mean of its divisors is an integer number (3006864225).
Almost surely, 223946900457 is an apocalyptic number.
It is an amenable number.
23946900457 is a deficient number, since it is larger than the sum of its proper divisors (108013343).
23946900457 is a wasteful number, since it uses less digits than its factorization.
23946900457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57755.
The product of its (nonzero) digits is 1632960, while the sum is 49.
The spelling of 23946900457 in words is "twenty-three billion, nine hundred forty-six million, nine hundred thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •