Base | Representation |
---|---|
bin | 10101111001010011… |
… | …010100110000111101 |
3 | 2020200110002222011201 |
4 | 111321103110300331 |
5 | 341122021223110 |
6 | 14444511415501 |
7 | 1461412144612 |
oct | 257123246075 |
9 | 66613088151 |
10 | 23509945405 |
11 | 9a74829a51 |
12 | 4681524591 |
13 | 22a8916ccb |
14 | 11d0512509 |
15 | 928e8eb3a |
hex | 5794d4c3d |
23509945405 has 8 divisors (see below), whose sum is σ = 29871460152. Its totient is φ = 17701605888.
The previous prime is 23509945357. The next prime is 23509945411. The reversal of 23509945405 is 50454990532.
It can be written as a sum of positive squares in 4 ways, for example, as 219217636 + 23290727769 = 14806^2 + 152613^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 23509945405 - 217 = 23509814333 is a prime.
It is a super-3 number, since 3×235099454053 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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, 138293712 + ... + 138293881.
It is an arithmetic number, because the mean of its divisors is an integer number (3733932519).
Almost surely, 223509945405 is an apocalyptic number.
It is an amenable number.
23509945405 is a deficient number, since it is larger than the sum of its proper divisors (6361514747).
23509945405 is a wasteful number, since it uses less digits than its factorization.
23509945405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276587615.
The product of its (nonzero) digits is 972000, while the sum is 46.
The spelling of 23509945405 in words is "twenty-three billion, five hundred nine million, nine hundred forty-five thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •