Base | Representation |
---|---|
bin | 1100000001101000001100… |
… | …1111011110101010001011 |
3 | 1201211000120122221001212011 |
4 | 3000122003033132222023 |
5 | 3213112340432210443 |
6 | 44042053134400351 |
7 | 2533160145626014 |
oct | 300320317365213 |
9 | 51730518831764 |
10 | 13222111210123 |
11 | 4238514095372 |
12 | 159664a3600b7 |
13 | 74babbb9667a |
14 | 339d4c95600b |
15 | 17de0dda5b9d |
hex | c06833dea8b |
13222111210123 has 8 divisors (see below), whose sum is σ = 13526436897792. Its totient is φ = 12918744029736.
The previous prime is 13222111210117. The next prime is 13222111210151. The reversal of 13222111210123 is 32101211122231.
It is a happy number.
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 13222111210123 - 213 = 13222111201931 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13222111210094 and 13222111210103.
It is not an unprimeable number, because it can be changed into a prime (13222111210103) 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, 239598915 + ... + 239654092.
It is an arithmetic number, because the mean of its divisors is an integer number (1690804612224).
Almost surely, 213222111210123 is an apocalyptic number.
13222111210123 is a deficient number, since it is larger than the sum of its proper divisors (304325687669).
13222111210123 is an equidigital number, since it uses as much as digits as its factorization.
13222111210123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479253641.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 13222111210123 its reverse (32101211122231), we get a palindrome (45323322332354).
The spelling of 13222111210123 in words is "thirteen trillion, two hundred twenty-two billion, one hundred eleven million, two hundred ten thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •