Base | Representation |
---|---|
bin | 1100011110010100011001… |
… | …1111100110100101101011 |
3 | 1210120010211212002211220211 |
4 | 3013211012133212211223 |
5 | 3244201321344001041 |
6 | 45100331244201551 |
7 | 2613606546155146 |
oct | 307450637464553 |
9 | 53503755084824 |
10 | 13715013265771 |
11 | 4408560491154 |
12 | 165608a2392b7 |
13 | 78642163756c |
14 | 355b4b20505d |
15 | 18bb5b7c4481 |
hex | c79467e696b |
13715013265771 has 2 divisors, whose sum is σ = 13715013265772. Its totient is φ = 13715013265770.
The previous prime is 13715013265691. The next prime is 13715013265787. The reversal of 13715013265771 is 17756231051731.
It is a strong prime.
It is an emirp because it is prime and its reverse (17756231051731) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13715013265771 - 29 = 13715013265259 is a prime.
It is not a weakly prime, because it can be changed into another prime (13715013260771) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6857506632885 + 6857506632886.
It is an arithmetic number, because the mean of its divisors is an integer number (6857506632886).
Almost surely, 213715013265771 is an apocalyptic number.
13715013265771 is a deficient number, since it is larger than the sum of its proper divisors (1).
13715013265771 is an equidigital number, since it uses as much as digits as its factorization.
13715013265771 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 926100, while the sum is 49.
It can be divided in two parts, 137150 and 13265771, that added together give a square (13402921 = 36612).
The spelling of 13715013265771 in words is "thirteen trillion, seven hundred fifteen billion, thirteen million, two hundred sixty-five thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •