Base | Representation |
---|---|
bin | 1010101010001101010110… |
… | …10110111101000001010001 |
3 | 10001222220001112202022101112 |
4 | 11111012223112331001101 |
5 | 11033022131413032223 |
6 | 121504231114543105 |
7 | 4636343503615121 |
oct | 525065326750121 |
9 | 101886045668345 |
10 | 23440511455313 |
11 | 7518079695097 |
12 | 2766b17a37a95 |
13 | 101057a46a6b4 |
14 | 5b07537bcc81 |
15 | 2a9b1c837778 |
hex | 1551ab5bd051 |
23440511455313 has 8 divisors (see below), whose sum is σ = 25276032892320. Its totient is φ = 21665171049120.
The previous prime is 23440511455303. The next prime is 23440511455381. The reversal of 23440511455313 is 31355411504432.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23440511455313 - 222 = 23440507261009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (23440511455303) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15045256895 + ... + 15045258452.
It is an arithmetic number, because the mean of its divisors is an integer number (3159504111540).
Almost surely, 223440511455313 is an apocalyptic number.
It is an amenable number.
23440511455313 is a deficient number, since it is larger than the sum of its proper divisors (1835521437007).
23440511455313 is a wasteful number, since it uses less digits than its factorization.
23440511455313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30090515407.
The product of its (nonzero) digits is 432000, while the sum is 41.
Adding to 23440511455313 its reverse (31355411504432), we get a palindrome (54795922959745).
The spelling of 23440511455313 in words is "twenty-three trillion, four hundred forty billion, five hundred eleven million, four hundred fifty-five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •