Base | Representation |
---|---|
bin | 10011001000000011001… |
… | …000000000100010011101 |
3 | 11122122110200200220101102 |
4 | 103020003020000202131 |
5 | 133013202440023311 |
6 | 2443441540322445 |
7 | 163645613162003 |
oct | 23100310004235 |
9 | 4578420626342 |
10 | 1314312423581 |
11 | 46744010a933 |
12 | 1928806a3425 |
13 | 96c29363b31 |
14 | 4788234aa73 |
15 | 242c56bd43b |
hex | 1320320089d |
1314312423581 has 2 divisors, whose sum is σ = 1314312423582. Its totient is φ = 1314312423580.
The previous prime is 1314312423451. The next prime is 1314312423607. The reversal of 1314312423581 is 1853242134131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1102781417956 + 211531005625 = 1050134^2 + 459925^2 .
It is a cyclic number.
It is not a de Polignac number, because 1314312423581 - 210 = 1314312422557 is a prime.
It is a super-2 number, since 2×13143124235812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1314312443581) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 657156211790 + 657156211791.
It is an arithmetic number, because the mean of its divisors is an integer number (657156211791).
Almost surely, 21314312423581 is an apocalyptic number.
It is an amenable number.
1314312423581 is a deficient number, since it is larger than the sum of its proper divisors (1).
1314312423581 is an equidigital number, since it uses as much as digits as its factorization.
1314312423581 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 69120, while the sum is 38.
The spelling of 1314312423581 in words is "one trillion, three hundred fourteen billion, three hundred twelve million, four hundred twenty-three thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •