Base | Representation |
---|---|
bin | 1001001100000001010000… |
… | …1001011100010111001001 |
3 | 1022202202021210110112101202 |
4 | 2103000110021130113021 |
5 | 2311003100340144402 |
6 | 33252501405553545 |
7 | 2061565324360565 |
oct | 223002411342711 |
9 | 38682253415352 |
10 | 10102101099977 |
11 | 3245305789687 |
12 | 1171a312758b5 |
13 | 58381604c693 |
14 | 26cd312446a5 |
15 | 127ba3860b02 |
hex | 9301425c5c9 |
10102101099977 has 2 divisors, whose sum is σ = 10102101099978. Its totient is φ = 10102101099976.
The previous prime is 10102101099973. The next prime is 10102101100061. The reversal of 10102101099977 is 77999010120101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9509230359616 + 592870740361 = 3083704^2 + 769981^2 .
It is a cyclic number.
It is not a de Polignac number, because 10102101099977 - 22 = 10102101099973 is a prime.
It is a super-3 number, since 3×101021010999773 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (10102101099973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051050549988 + 5051050549989.
It is an arithmetic number, because the mean of its divisors is an integer number (5051050549989).
Almost surely, 210102101099977 is an apocalyptic number.
It is an amenable number.
10102101099977 is a deficient number, since it is larger than the sum of its proper divisors (1).
10102101099977 is an equidigital number, since it uses as much as digits as its factorization.
10102101099977 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 71442, while the sum is 47.
The spelling of 10102101099977 in words is "ten trillion, one hundred two billion, one hundred one million, ninety-nine thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •