Base | Representation |
---|---|
bin | 11000110010111011… |
… | …10100111000110101 |
3 | 1021100202011100021002 |
4 | 30121131310320311 |
5 | 204230402313333 |
6 | 10040541333045 |
7 | 650613263063 |
oct | 143135647065 |
9 | 37322140232 |
10 | 13312151093 |
11 | 57113a916a |
12 | 26b6267185 |
13 | 1341c654a7 |
14 | 903dc3033 |
15 | 52da610e8 |
hex | 319774e35 |
13312151093 has 2 divisors, whose sum is σ = 13312151094. Its totient is φ = 13312151092.
The previous prime is 13312151077. The next prime is 13312151107. The reversal of 13312151093 is 39015121331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13162284529 + 149866564 = 114727^2 + 12242^2 .
It is a cyclic number.
It is not a de Polignac number, because 13312151093 - 24 = 13312151077 is a prime.
It is a super-2 number, since 2×133121510932 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13312151003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6656075546 + 6656075547.
It is an arithmetic number, because the mean of its divisors is an integer number (6656075547).
Almost surely, 213312151093 is an apocalyptic number.
It is an amenable number.
13312151093 is a deficient number, since it is larger than the sum of its proper divisors (1).
13312151093 is an equidigital number, since it uses as much as digits as its factorization.
13312151093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2430, while the sum is 29.
The spelling of 13312151093 in words is "thirteen billion, three hundred twelve million, one hundred fifty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •