Base | Representation |
---|---|
bin | 1011111011000110100110… |
… | …1011100101010100011011 |
3 | 1201102022020100210011020202 |
4 | 2332301221223211110123 |
5 | 3204243301341020443 |
6 | 43514353521412415 |
7 | 2522111230502441 |
oct | 276615153452433 |
9 | 51368210704222 |
10 | 13110013220123 |
11 | 41a4a1a75a326 |
12 | 1578984a9a10b |
13 | 741365b33781 |
14 | 334756c8ab91 |
15 | 17b04c9e17b8 |
hex | bec69ae551b |
13110013220123 has 4 divisors (see below), whose sum is σ = 13429769640168. Its totient is φ = 12790256800080.
The previous prime is 13110013220071. The next prime is 13110013220141. The reversal of 13110013220123 is 32102231001131.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13110013220123 - 234 = 13092833350939 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13110013220095 and 13110013220104.
It is not an unprimeable number, because it can be changed into a prime (13110013220023) 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, 159878209961 + ... + 159878210042.
It is an arithmetic number, because the mean of its divisors is an integer number (3357442410042).
Almost surely, 213110013220123 is an apocalyptic number.
13110013220123 is a deficient number, since it is larger than the sum of its proper divisors (319756420045).
13110013220123 is an equidigital number, since it uses as much as digits as its factorization.
13110013220123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 319756420044.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13110013220123 its reverse (32102231001131), we get a palindrome (45212244221254).
The spelling of 13110013220123 in words is "thirteen trillion, one hundred ten billion, thirteen million, two hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •