Base | Representation |
---|---|
bin | 1011111011110100000111… |
… | …1111011010010001101111 |
3 | 1201110110202221000020002000 |
4 | 2332331001333122101233 |
5 | 3204443312422343043 |
6 | 43524134213303343 |
7 | 2523023101413066 |
oct | 276750177322157 |
9 | 51413687006060 |
10 | 13122232231023 |
11 | 41aa11aaa9043 |
12 | 157b215034b53 |
13 | 74256247a736 |
14 | 3351959d91dd |
15 | 17b5155c42d3 |
hex | bef41fda46f |
13122232231023 has 32 divisors (see below), whose sum is σ = 20150682854400. Its totient is φ = 8429701821408.
The previous prime is 13122232230971. The next prime is 13122232231039. The reversal of 13122232231023 is 32013223222131.
13122232231023 is a `hidden beast` number, since 1 + 3 + 1 + 2 + 2 + 2 + 322 + 310 + 23 = 666.
It is not a de Polignac number, because 13122232231023 - 29 = 13122232230511 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13122232231063) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16265115 + ... + 17052812.
It is an arithmetic number, because the mean of its divisors is an integer number (629708839200).
Almost surely, 213122232231023 is an apocalyptic number.
13122232231023 is a deficient number, since it is larger than the sum of its proper divisors (7028450623377).
13122232231023 is a wasteful number, since it uses less digits than its factorization.
13122232231023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33318468 (or 33318462 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 13122232231023 its reverse (32013223222131), we get a palindrome (45135455453154).
The spelling of 13122232231023 in words is "thirteen trillion, one hundred twenty-two billion, two hundred thirty-two million, two hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •