Base | Representation |
---|---|
bin | 10111001111001110010010… |
… | …010010110001000000101111 |
3 | 111101212100011102201102000111 |
4 | 113033032102102301000233 |
5 | 101343431030001414244 |
6 | 1001210330023440451 |
7 | 30345536016504532 |
oct | 2717162222610057 |
9 | 441770142642014 |
10 | 102201201201199 |
11 | 2a623316775421 |
12 | b56733b5b6127 |
13 | 45046bb821609 |
14 | 1b347c9106a19 |
15 | bc374b3e7e34 |
hex | 5cf3924b102f |
102201201201199 has 2 divisors, whose sum is σ = 102201201201200. Its totient is φ = 102201201201198.
The previous prime is 102201201201181. The next prime is 102201201201259. The reversal of 102201201201199 is 991102102102201.
It is a weak prime.
It is an emirp because it is prime and its reverse (991102102102201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102201201201199 - 25 = 102201201201167 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102201201201199.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102201201201139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51100600600599 + 51100600600600.
It is an arithmetic number, because the mean of its divisors is an integer number (51100600600600).
Almost surely, 2102201201201199 is an apocalyptic number.
102201201201199 is a deficient number, since it is larger than the sum of its proper divisors (1).
102201201201199 is an equidigital number, since it uses as much as digits as its factorization.
102201201201199 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 31.
The spelling of 102201201201199 in words is "one hundred two trillion, two hundred one billion, two hundred one million, two hundred one thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •