Base | Representation |
---|---|
bin | 1011111011010101110101… |
… | …0010000011110011101111 |
3 | 1201102200210012002201110111 |
4 | 2332311131102003303233 |
5 | 3204330134120414332 |
6 | 43520311235120451 |
7 | 2522314425136216 |
oct | 276653522036357 |
9 | 51380705081414 |
10 | 13114100169967 |
11 | 41a6727731225 |
12 | 1579725743127 |
13 | 7418677799a4 |
14 | 334a2399607d |
15 | 17b1db6de947 |
hex | bed5d483cef |
13114100169967 has 2 divisors, whose sum is σ = 13114100169968. Its totient is φ = 13114100169966.
The previous prime is 13114100169953. The next prime is 13114100169971. The reversal of 13114100169967 is 76996100141131.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13114100169967 - 235 = 13079740431599 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13114100169967.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13114100169997) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6557050084983 + 6557050084984.
It is an arithmetic number, because the mean of its divisors is an integer number (6557050084984).
Almost surely, 213114100169967 is an apocalyptic number.
13114100169967 is a deficient number, since it is larger than the sum of its proper divisors (1).
13114100169967 is an equidigital number, since it uses as much as digits as its factorization.
13114100169967 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 244944, while the sum is 49.
The spelling of 13114100169967 in words is "thirteen trillion, one hundred fourteen billion, one hundred million, one hundred sixty-nine thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •