Base | Representation |
---|---|
bin | 10100001110111011111… |
… | …000011000001100010101 |
3 | 11220220221012212102000122 |
4 | 110032323320120030111 |
5 | 140240043144231112 |
6 | 2542430402321325 |
7 | 202312031500103 |
oct | 24167370301425 |
9 | 4826835772018 |
10 | 1390426555157 |
11 | 4967495a6502 |
12 | 1a5583059245 |
13 | a11693c8003 |
14 | 4b422da0c73 |
15 | 2627c95d872 |
hex | 143bbe18315 |
1390426555157 has 2 divisors, whose sum is σ = 1390426555158. Its totient is φ = 1390426555156.
The previous prime is 1390426555153. The next prime is 1390426555181. The reversal of 1390426555157 is 7515556240931.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1025907662641 + 364518892516 = 1012871^2 + 603754^2 .
It is an emirp because it is prime and its reverse (7515556240931) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1390426555157 - 22 = 1390426555153 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1390426555099 and 1390426555108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1390426555153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 695213277578 + 695213277579.
It is an arithmetic number, because the mean of its divisors is an integer number (695213277579).
Almost surely, 21390426555157 is an apocalyptic number.
It is an amenable number.
1390426555157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1390426555157 is an equidigital number, since it uses as much as digits as its factorization.
1390426555157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5670000, while the sum is 53.
The spelling of 1390426555157 in words is "one trillion, three hundred ninety billion, four hundred twenty-six million, five hundred fifty-five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •