Base | Representation |
---|---|
bin | 11000011100011000… |
… | …11001000001010001 |
3 | 1020212120022001102200 |
4 | 30032030121001101 |
5 | 203333443443441 |
6 | 10010104033413 |
7 | 643125631644 |
oct | 141614310121 |
9 | 36776261380 |
10 | 13123031121 |
11 | 5624677572 |
12 | 2662a62869 |
13 | 1311a1a495 |
14 | 8c6c33a5b |
15 | 51c1557b6 |
hex | 30e319051 |
13123031121 has 12 divisors (see below), whose sum is σ = 19016054148. Its totient is φ = 8720734464.
The previous prime is 13123031111. The next prime is 13123031123. The reversal of 13123031121 is 12113032131.
It can be written as a sum of positive squares in 2 ways, for example, as 6161465025 + 6961566096 = 78495^2 + 83436^2 .
It is a de Polignac number, because none of the positive numbers 2k-13123031121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13123031094 and 13123031103.
It is not an unprimeable number, because it can be changed into a prime (13123031123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2326440 + ... + 2332073.
It is an arithmetic number, because the mean of its divisors is an integer number (1584671179).
Almost surely, 213123031121 is an apocalyptic number.
It is an amenable number.
13123031121 is a deficient number, since it is larger than the sum of its proper divisors (5893023027).
13123031121 is a wasteful number, since it uses less digits than its factorization.
13123031121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4658832 (or 4658829 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 13123031121 its reverse (12113032131), we get a palindrome (25236063252).
The spelling of 13123031121 in words is "thirteen billion, one hundred twenty-three million, thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •