Base | Representation |
---|---|
bin | 1010100000101111010100… |
… | …11011100000111111011101 |
3 | 10000211210020200201121212010 |
4 | 11100113222123200333131 |
5 | 11012204312414220331 |
6 | 121054542042501433 |
7 | 4604005006005036 |
oct | 520275233407735 |
9 | 100753220647763 |
10 | 23115152101341 |
11 | 7402098828913 |
12 | 2713a55804879 |
13 | cb89988258c1 |
14 | 59caca6ada8d |
15 | 2a1428b70e46 |
hex | 1505ea6e0fdd |
23115152101341 has 8 divisors (see below), whose sum is σ = 30836016151200. Its totient is φ = 15402194726192.
The previous prime is 23115152101331. The next prime is 23115152101399. The reversal of 23115152101341 is 14310125151132.
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 23115152101341 - 27 = 23115152101213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23115152101299 and 23115152101308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23115152101331) 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, 1976661855 + ... + 1976673548.
It is an arithmetic number, because the mean of its divisors is an integer number (3854502018900).
Almost surely, 223115152101341 is an apocalyptic number.
It is an amenable number.
23115152101341 is a deficient number, since it is larger than the sum of its proper divisors (7720864049859).
23115152101341 is a wasteful number, since it uses less digits than its factorization.
23115152101341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3953337355.
The product of its (nonzero) digits is 3600, while the sum is 30.
Adding to 23115152101341 its reverse (14310125151132), we get a palindrome (37425277252473).
The spelling of 23115152101341 in words is "twenty-three trillion, one hundred fifteen billion, one hundred fifty-two million, one hundred one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •