Base | Representation |
---|---|
bin | 1011111010101000111000… |
… | …0001111010101101110101 |
3 | 1201101112122012211002000021 |
4 | 2332222032001322231311 |
5 | 3204130430434320432 |
6 | 43510554012245141 |
7 | 2521406410663654 |
oct | 276521601725565 |
9 | 51345565732007 |
10 | 13102033120117 |
11 | 41a15a5144057 |
12 | 15773184707b1 |
13 | 74069376a3c6 |
14 | 3341db0c319b |
15 | 17ac32127697 |
hex | bea8e07ab75 |
13102033120117 has 2 divisors, whose sum is σ = 13102033120118. Its totient is φ = 13102033120116.
The previous prime is 13102033120103. The next prime is 13102033120181. The reversal of 13102033120117 is 71102133020131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12662253260836 + 439779859281 = 3558406^2 + 663159^2 .
It is a cyclic number.
It is not a de Polignac number, because 13102033120117 - 243 = 4305940097909 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13102033120091 and 13102033120100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13102033150117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6551016560058 + 6551016560059.
It is an arithmetic number, because the mean of its divisors is an integer number (6551016560059).
Almost surely, 213102033120117 is an apocalyptic number.
It is an amenable number.
13102033120117 is a deficient number, since it is larger than the sum of its proper divisors (1).
13102033120117 is an equidigital number, since it uses as much as digits as its factorization.
13102033120117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 25.
Adding to 13102033120117 its reverse (71102133020131), we get a palindrome (84204166140248).
The spelling of 13102033120117 in words is "thirteen trillion, one hundred two billion, thirty-three million, one hundred twenty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •