Base | Representation |
---|---|
bin | 1011111011101111111111… |
… | …0100010101001010010111 |
3 | 1201110100220112222011220011 |
4 | 2332323333310111022113 |
5 | 3204434024214431411 |
6 | 43523432114021051 |
7 | 2522653431023065 |
oct | 276737764251227 |
9 | 51410815864804 |
10 | 13121122030231 |
11 | 41a9700356826 |
12 | 157ab65277787 |
13 | 7424164679a7 |
14 | 3350cc3a3035 |
15 | 17b49cdc5c21 |
hex | beeffd15297 |
13121122030231 has 16 divisors (see below), whose sum is σ = 13476477661920. Its totient is φ = 12767460180480.
The previous prime is 13121122030217. The next prime is 13121122030243. The reversal of 13121122030231 is 13203022112131.
It is a cyclic number.
It is not a de Polignac number, because 13121122030231 - 215 = 13121121997463 is a prime.
It is a super-2 number, since 2×131211220302312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13121122030631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 95397196 + ... + 95534638.
It is an arithmetic number, because the mean of its divisors is an integer number (842279853870).
Almost surely, 213121122030231 is an apocalyptic number.
13121122030231 is a deficient number, since it is larger than the sum of its proper divisors (355355631689).
13121122030231 is a wasteful number, since it uses less digits than its factorization.
13121122030231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143586.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 13121122030231 its reverse (13203022112131), we get a palindrome (26324144142362).
The spelling of 13121122030231 in words is "thirteen trillion, one hundred twenty-one billion, one hundred twenty-two million, thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •