Base | Representation |
---|---|
bin | 10110000010001001010… |
… | …010000011110101111001 |
3 | 12100202020102220221021002 |
4 | 112002021102003311321 |
5 | 144301420203413423 |
6 | 3115325453054345 |
7 | 214251411051233 |
oct | 26021122036571 |
9 | 5322212827232 |
10 | 1514131701113 |
11 | 534159965619 |
12 | 2055477873b5 |
13 | aca220b8325 |
14 | 533da427253 |
15 | 295bcd45228 |
hex | 16089483d79 |
1514131701113 has 2 divisors, whose sum is σ = 1514131701114. Its totient is φ = 1514131701112.
The previous prime is 1514131701041. The next prime is 1514131701151. The reversal of 1514131701113 is 3111071314151.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1494339994624 + 19791706489 = 1222432^2 + 140683^2 .
It is a cyclic number.
It is not a de Polignac number, because 1514131701113 - 228 = 1513863265657 is a prime.
It is not a weakly prime, because it can be changed into another prime (1514131701163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 757065850556 + 757065850557.
It is an arithmetic number, because the mean of its divisors is an integer number (757065850557).
Almost surely, 21514131701113 is an apocalyptic number.
It is an amenable number.
1514131701113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1514131701113 is an equidigital number, since it uses as much as digits as its factorization.
1514131701113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1260, while the sum is 29.
The spelling of 1514131701113 in words is "one trillion, five hundred fourteen billion, one hundred thirty-one million, seven hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •