Base | Representation |
---|---|
bin | 10010001001100010001010… |
… | …11111111000111101010101 |
3 | 12020022100200200000002201202 |
4 | 21010301011133320331111 |
5 | 20212341141014231401 |
6 | 220514222445002245 |
7 | 11256255025403525 |
oct | 1104610537707525 |
9 | 166270620002652 |
10 | 39910002102101 |
11 | 1179781180a35a |
12 | 45869aab53385 |
13 | 1936660030241 |
14 | 9bd9239a7685 |
15 | 49323db5806b |
hex | 244c457f8f55 |
39910002102101 has 2 divisors, whose sum is σ = 39910002102102. Its totient is φ = 39910002102100.
The previous prime is 39910002101951. The next prime is 39910002102121. The reversal of 39910002102101 is 10120120001993.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 39644338140625 + 265663961476 = 6296375^2 + 515426^2 .
It is an emirp because it is prime and its reverse (10120120001993) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 39910002102101 - 234 = 39892822232917 is a prime.
It is a super-2 number, since 2×399100021021012 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (39910002102121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 19955001051050 + 19955001051051.
It is an arithmetic number, because the mean of its divisors is an integer number (19955001051051).
Almost surely, 239910002102101 is an apocalyptic number.
It is an amenable number.
39910002102101 is a deficient number, since it is larger than the sum of its proper divisors (1).
39910002102101 is an equidigital number, since it uses as much as digits as its factorization.
39910002102101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 29.
The spelling of 39910002102101 in words is "thirty-nine trillion, nine hundred ten billion, two million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •