Base | Representation |
---|---|
bin | 1011111011000111011010… |
… | …1110001100110110001001 |
3 | 1201102022210121110211201000 |
4 | 2332301312232030312021 |
5 | 3204244223343310441 |
6 | 43514431335045213 |
7 | 2522116525256241 |
oct | 276616656146611 |
9 | 51368717424630 |
10 | 13110232010121 |
11 | 41a5022206504 |
12 | 1578a26210809 |
13 | 74139c2694cc |
14 | 334777d60b21 |
15 | 17b061d0d2b6 |
hex | bec76b8cd89 |
13110232010121 has 96 divisors (see below), whose sum is σ = 20613414297600. Its totient is φ = 8233872847200.
The previous prime is 13110232010107. The next prime is 13110232010123. The reversal of 13110232010121 is 12101023201131.
13110232010121 is a `hidden beast` number, since 1 + 311 + 0 + 2 + 320 + 10 + 1 + 21 = 666.
It is not a de Polignac number, because 13110232010121 - 210 = 13110232009097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13110232010094 and 13110232010103.
It is not an unprimeable number, because it can be changed into a prime (13110232010123) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1833338896 + ... + 1833346046.
It is an arithmetic number, because the mean of its divisors is an integer number (214723065600).
Almost surely, 213110232010121 is an apocalyptic number.
It is an amenable number.
13110232010121 is a deficient number, since it is larger than the sum of its proper divisors (7503182287479).
13110232010121 is a wasteful number, since it uses less digits than its factorization.
13110232010121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8224 (or 8199 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 13110232010121 its reverse (12101023201131), we get a palindrome (25211255211252).
The spelling of 13110232010121 in words is "thirteen trillion, one hundred ten billion, two hundred thirty-two million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •