Base | Representation |
---|---|
bin | 10111001101110000001110… |
… | …001001101111100011110101 |
3 | 111101111200110111010112221022 |
4 | 113031300032021233203311 |
5 | 101340302202144330022 |
6 | 1001052103453230525 |
7 | 30335332064434424 |
oct | 2715601611574365 |
9 | 441450414115838 |
10 | 102100199995637 |
11 | 2a5944a7172808 |
12 | b54b852492445 |
13 | 44c801377205c |
14 | 1b2d9671032bb |
15 | bc0cd933ec42 |
hex | 5cdc0e26f8f5 |
102100199995637 has 2 divisors, whose sum is σ = 102100199995638. Its totient is φ = 102100199995636.
The previous prime is 102100199995627. The next prime is 102100199995693. The reversal of 102100199995637 is 736599991001201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 87934242910276 + 14165957085361 = 9377326^2 + 3763769^2 .
It is a cyclic number.
It is not a de Polignac number, because 102100199995637 - 210 = 102100199994613 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102100199995637.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102100199995627) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51050099997818 + 51050099997819.
It is an arithmetic number, because the mean of its divisors is an integer number (51050099997819).
Almost surely, 2102100199995637 is an apocalyptic number.
It is an amenable number.
102100199995637 is a deficient number, since it is larger than the sum of its proper divisors (1).
102100199995637 is an equidigital number, since it uses as much as digits as its factorization.
102100199995637 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8266860, while the sum is 62.
The spelling of 102100199995637 in words is "one hundred two trillion, one hundred billion, one hundred ninety-nine million, nine hundred ninety-five thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •