Base | Representation |
---|---|
bin | 1010101100100111110101… |
… | …00101011110010110000001 |
3 | 10002021211010022220221202012 |
4 | 11112103322211132112001 |
5 | 11040402003412244023 |
6 | 122010304345302305 |
7 | 4645340616510215 |
oct | 526237245362601 |
9 | 102254108827665 |
10 | 23523445040513 |
11 | 754a26751a150 |
12 | 277b002194995 |
13 | 10183362a2032 |
14 | 5b477ddd2945 |
15 | 2abd7362b978 |
hex | 1564fa95e581 |
23523445040513 has 8 divisors (see below), whose sum is σ = 25690233263520. Its totient is φ = 21361372354080.
The previous prime is 23523445040477. The next prime is 23523445040521. The reversal of 23523445040513 is 31504054432532.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23523445040513 - 230 = 23522371298689 is a prime.
It is a super-2 number, since 2×235234450405132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23523445040533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1178873708 + ... + 1178893661.
It is an arithmetic number, because the mean of its divisors is an integer number (3211279157940).
Almost surely, 223523445040513 is an apocalyptic number.
It is an amenable number.
23523445040513 is a deficient number, since it is larger than the sum of its proper divisors (2166788223007).
23523445040513 is a wasteful number, since it uses less digits than its factorization.
23523445040513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2357768287.
The product of its (nonzero) digits is 864000, while the sum is 41.
The spelling of 23523445040513 in words is "twenty-three trillion, five hundred twenty-three billion, four hundred forty-five million, forty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •