Base | Representation |
---|---|
bin | 1010101001001010011101… |
… | …11100101011100000100101 |
3 | 10001212110100220111201012112 |
4 | 11110211032330223200211 |
5 | 11031430110414404410 |
6 | 121435531520130405 |
7 | 4633632560553323 |
oct | 524451674534045 |
9 | 101773326451175 |
10 | 23404601325605 |
11 | 7503921323145 |
12 | 275bb75766a05 |
13 | 100a076814736 |
14 | 5acb0847ad13 |
15 | 2a8c19e29105 |
hex | 15494ef2b825 |
23404601325605 has 8 divisors (see below), whose sum is σ = 28088432367000. Its totient is φ = 18721740542976.
The previous prime is 23404601325577. The next prime is 23404601325613. The reversal of 23404601325605 is 50652310640432.
It can be written as a sum of positive squares in 4 ways, for example, as 3440880311521 + 19963721014084 = 1854961^2 + 4468078^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 23404601325605 - 218 = 23404601063461 is a prime.
It is a super-2 number, since 2×234046013256052 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 242511620 + ... + 242608109.
It is an arithmetic number, because the mean of its divisors is an integer number (3511054045875).
Almost surely, 223404601325605 is an apocalyptic number.
It is an amenable number.
23404601325605 is a deficient number, since it is larger than the sum of its proper divisors (4683831041395).
23404601325605 is an equidigital number, since it uses as much as digits as its factorization.
23404601325605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 485129383.
The product of its (nonzero) digits is 518400, while the sum is 41.
The spelling of 23404601325605 in words is "twenty-three trillion, four hundred four billion, six hundred one million, three hundred twenty-five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •