Base | Representation |
---|---|
bin | 1100000111010101010100… |
… | …1010001110111111110011 |
3 | 1202011101120020010220000200 |
4 | 3001311111022032333303 |
5 | 3221214102304043443 |
6 | 44155102453050243 |
7 | 2543230022461326 |
oct | 301652512167763 |
9 | 52141506126020 |
10 | 13320122331123 |
11 | 427603988a213 |
12 | 15b1642026983 |
13 | 75810b62391a |
14 | 3409a97b47bd |
15 | 1817486c7dd3 |
hex | c1d5528eff3 |
13320122331123 has 48 divisors (see below), whose sum is σ = 19827338633856. Its totient is φ = 8612533278720.
The previous prime is 13320122331119. The next prime is 13320122331149. The reversal of 13320122331123 is 32113322102331.
13320122331123 is a `hidden beast` number, since 1 + 3 + 3 + 201 + 2 + 2 + 331 + 123 = 666.
It is not a de Polignac number, because 13320122331123 - 22 = 13320122331119 is a prime.
It is a super-2 number, since 2×133201223311232 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13320122331163) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 270374313 + ... + 270423573.
It is an arithmetic number, because the mean of its divisors is an integer number (413069554872).
Almost surely, 213320122331123 is an apocalyptic number.
13320122331123 is a deficient number, since it is larger than the sum of its proper divisors (6507216302733).
13320122331123 is a wasteful number, since it uses less digits than its factorization.
13320122331123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55084 (or 55081 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
Adding to 13320122331123 its reverse (32113322102331), we get a palindrome (45433444433454).
The spelling of 13320122331123 in words is "thirteen trillion, three hundred twenty billion, one hundred twenty-two million, three hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •