Base | Representation |
---|---|
bin | 1011111011000111011101… |
… | …0100011001001110110011 |
3 | 1201102022211022022111212022 |
4 | 2332301313110121032303 |
5 | 3204244233424203243 |
6 | 43514432333422055 |
7 | 2522120006336315 |
oct | 276616724311663 |
9 | 51368738274768 |
10 | 13110242022323 |
11 | 41a5027924856 |
12 | 1578a2963a92b |
13 | 7413a13637a4 |
14 | 3347794097b5 |
15 | 17b062b39b68 |
hex | bec775193b3 |
13110242022323 has 8 divisors (see below), whose sum is σ = 13804132396800. Its totient is φ = 12416739411528.
The previous prime is 13110242022299. The next prime is 13110242022329. The reversal of 13110242022323 is 32322024201131.
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 13110242022323 - 210 = 13110242021299 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13110242022292 and 13110242022301.
It is not an unprimeable number, because it can be changed into a prime (13110242022329) 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, 96871511 + ... + 97006752.
It is an arithmetic number, because the mean of its divisors is an integer number (1725516549600).
Almost surely, 213110242022323 is an apocalyptic number.
13110242022323 is a deficient number, since it is larger than the sum of its proper divisors (693890374477).
13110242022323 is a wasteful number, since it uses less digits than its factorization.
13110242022323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 193881841.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 13110242022323 its reverse (32322024201131), we get a palindrome (45432266223454).
The spelling of 13110242022323 in words is "thirteen trillion, one hundred ten billion, two hundred forty-two million, twenty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •