Base | Representation |
---|---|
bin | 1011111010101000111000… |
… | …0001111010101101110111 |
3 | 1201101112122012211002000100 |
4 | 2332222032001322231313 |
5 | 3204130430434320434 |
6 | 43510554012245143 |
7 | 2521406410663656 |
oct | 276521601725567 |
9 | 51345565732010 |
10 | 13102033120119 |
11 | 41a15a5144059 |
12 | 15773184707b3 |
13 | 74069376a3c8 |
14 | 3341db0c319d |
15 | 17ac32127699 |
hex | bea8e07ab77 |
13102033120119 has 12 divisors (see below), whose sum is σ = 18925270533000. Its totient is φ = 8734637247504.
The previous prime is 13102033120117. The next prime is 13102033120181. The reversal of 13102033120119 is 91102133020131.
13102033120119 is a `hidden beast` number, since 1 + 31 + 0 + 203 + 312 + 0 + 119 = 666.
It is not a de Polignac number, because 13102033120119 - 21 = 13102033120117 is a prime.
It is a super-2 number, since 2×131020331201192 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13102033120092 and 13102033120101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13102033120117) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2647164 + ... + 5762945.
It is an arithmetic number, because the mean of its divisors is an integer number (1577105877750).
Almost surely, 213102033120119 is an apocalyptic number.
13102033120119 is a deficient number, since it is larger than the sum of its proper divisors (5823237412881).
13102033120119 is a wasteful number, since it uses less digits than its factorization.
13102033120119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8583214 (or 8583211 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 27.
The spelling of 13102033120119 in words is "thirteen trillion, one hundred two billion, thirty-three million, one hundred twenty thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •