Base | Representation |
---|---|
bin | 1011111011101100001110… |
… | …0000100101001011110111 |
3 | 1201110021022001001220020000 |
4 | 2332323003200211023313 |
5 | 3204424441204020043 |
6 | 43523143451242343 |
7 | 2522616363543102 |
oct | 276730340451367 |
9 | 51407261056200 |
10 | 13120110220023 |
11 | 41a92311a6844 |
12 | 157a9224493b3 |
13 | 7422b4954021 |
14 | 335033c5d739 |
15 | 17b43e1602d3 |
hex | beec38252f7 |
13120110220023 has 20 divisors (see below), whose sum is σ = 19599377629920. Its totient is φ = 8746650607392.
The previous prime is 13120110219991. The next prime is 13120110220121. The reversal of 13120110220023 is 32002201102131.
13120110220023 is a `hidden beast` number, since 1 + 312 + 0 + 110 + 220 + 0 + 23 = 666.
It is not a de Polignac number, because 13120110220023 - 25 = 13120110219991 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13120110219978 and 13120110220005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13120110220223) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 7666411 + ... + 9220307.
It is an arithmetic number, because the mean of its divisors is an integer number (979968881496).
Almost surely, 213120110220023 is an apocalyptic number.
13120110220023 is a deficient number, since it is larger than the sum of its proper divisors (6479267409897).
13120110220023 is a wasteful number, since it uses less digits than its factorization.
13120110220023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1658148 (or 1658139 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 13120110220023 its reverse (32002201102131), we get a palindrome (45122311322154).
The spelling of 13120110220023 in words is "thirteen trillion, one hundred twenty billion, one hundred ten million, two hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •