Base | Representation |
---|---|
bin | 1010100100100001111101… |
… | …01010001001010101001101 |
3 | 10001022020110212220222022220 |
4 | 11102100332222021111031 |
5 | 11021323102021212423 |
6 | 121234443524325553 |
7 | 4616266014636534 |
oct | 522207652112515 |
9 | 101266425828286 |
10 | 23245414241613 |
11 | 74523633728a3 |
12 | 273514a2438b9 |
13 | cc8057b00905 |
14 | 5a51268d531b |
15 | 2a49eea159e3 |
hex | 15243ea8954d |
23245414241613 has 4 divisors (see below), whose sum is σ = 30993885655488. Its totient is φ = 15496942827740.
The previous prime is 23245414241603. The next prime is 23245414241659. The reversal of 23245414241613 is 31614241454232.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 23245414241613 - 26 = 23245414241549 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23245414241603) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3874235706933 + ... + 3874235706938.
It is an arithmetic number, because the mean of its divisors is an integer number (7748471413872).
Almost surely, 223245414241613 is an apocalyptic number.
It is an amenable number.
23245414241613 is a deficient number, since it is larger than the sum of its proper divisors (7748471413875).
23245414241613 is an equidigital number, since it uses as much as digits as its factorization.
23245414241613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7748471413874.
The product of its digits is 552960, while the sum is 42.
Adding to 23245414241613 its reverse (31614241454232), we get a palindrome (54859655695845).
The spelling of 23245414241613 in words is "twenty-three trillion, two hundred forty-five billion, four hundred fourteen million, two hundred forty-one thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •