Base | Representation |
---|---|
bin | 1011111011010101111100… |
… | …1101000000101000111101 |
3 | 1201102200212102202012201101 |
4 | 2332311133031000220331 |
5 | 3204330220343310301 |
6 | 43520314350013101 |
7 | 2522315266115323 |
oct | 276653715005075 |
9 | 51380772665641 |
10 | 13114132400701 |
11 | 41a67439456a2 |
12 | 15797344a7191 |
13 | 741871353127 |
14 | 334a27d85d13 |
15 | 17b1de459701 |
hex | bed5f340a3d |
13114132400701 has 2 divisors, whose sum is σ = 13114132400702. Its totient is φ = 13114132400700.
The previous prime is 13114132400669. The next prime is 13114132400773. The reversal of 13114132400701 is 10700423141131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11393824724676 + 1720307676025 = 3375474^2 + 1311605^2 .
It is a cyclic number.
It is not a de Polignac number, because 13114132400701 - 25 = 13114132400669 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13114132400701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13114132400791) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6557066200350 + 6557066200351.
It is an arithmetic number, because the mean of its divisors is an integer number (6557066200351).
Almost surely, 213114132400701 is an apocalyptic number.
It is an amenable number.
13114132400701 is a deficient number, since it is larger than the sum of its proper divisors (1).
13114132400701 is an equidigital number, since it uses as much as digits as its factorization.
13114132400701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 28.
Adding to 13114132400701 its reverse (10700423141131), we get a palindrome (23814555541832).
The spelling of 13114132400701 in words is "thirteen trillion, one hundred fourteen billion, one hundred thirty-two million, four hundred thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •