Base | Representation |
---|---|
bin | 1011111011101111111100… |
… | …1110001011111110010001 |
3 | 1201110100212212011011200202 |
4 | 2332323333032023332101 |
5 | 3204434014134443441 |
6 | 43523431115424545 |
7 | 2522653250026133 |
oct | 276737716137621 |
9 | 51410785134622 |
10 | 13121112031121 |
11 | 41a96a57472a6 |
12 | 157ab61a55155 |
13 | 742414376663 |
14 | 3350cad1d053 |
15 | 17b49c09d19b |
hex | beeff38bf91 |
13121112031121 has 8 divisors (see below), whose sum is σ = 13166115044544. Its totient is φ = 13076123714640.
The previous prime is 13121112031103. The next prime is 13121112031123. The reversal of 13121112031121 is 12113021112131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13121112031121 - 230 = 13120038289297 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13121112031093 and 13121112031102.
It is not an unprimeable number, because it can be changed into a prime (13121112031123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1884125 + ... + 5458218.
It is an arithmetic number, because the mean of its divisors is an integer number (1645764380568).
Almost surely, 213121112031121 is an apocalyptic number.
It is an amenable number.
13121112031121 is a deficient number, since it is larger than the sum of its proper divisors (45003013423).
13121112031121 is an equidigital number, since it uses as much as digits as its factorization.
13121112031121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7348471.
The product of its (nonzero) digits is 72, while the sum is 20.
Adding to 13121112031121 its reverse (12113021112131), we get a palindrome (25234133143252).
The spelling of 13121112031121 in words is "thirteen trillion, one hundred twenty-one billion, one hundred twelve million, thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •