Base | Representation |
---|---|
bin | 10011111000100100… |
… | …11001001100111111 |
3 | 1000112222010212000121 |
4 | 21330102121030333 |
5 | 133330313144244 |
6 | 4523141035411 |
7 | 525353055325 |
oct | 117422311477 |
9 | 30488125017 |
10 | 10675131199 |
11 | 4588919087 |
12 | 209b0b5b67 |
13 | 10118302a5 |
14 | 733aa5d15 |
15 | 4272bbc84 |
hex | 27c49933f |
10675131199 has 2 divisors, whose sum is σ = 10675131200. Its totient is φ = 10675131198.
The previous prime is 10675131191. The next prime is 10675131221. The reversal of 10675131199 is 99113157601.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10675131199 - 23 = 10675131191 is a prime.
It is a super-2 number, since 2×106751311992 (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 (10675131191) 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, 5337565599 + 5337565600.
It is an arithmetic number, because the mean of its divisors is an integer number (5337565600).
Almost surely, 210675131199 is an apocalyptic number.
10675131199 is a deficient number, since it is larger than the sum of its proper divisors (1).
10675131199 is an equidigital number, since it uses as much as digits as its factorization.
10675131199 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51030, while the sum is 43.
The spelling of 10675131199 in words is "ten billion, six hundred seventy-five million, one hundred thirty-one thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •