Base | Representation |
---|---|
bin | 11000000110101001100000… |
… | …110101101111010101000101 |
3 | 111220100110100200201202111211 |
4 | 120012221200311233111011 |
5 | 102343331443410000401 |
6 | 1013244154121131421 |
7 | 31220653545043525 |
oct | 3006514065572505 |
9 | 456313320652454 |
10 | 106010007500101 |
11 | 30861656616571 |
12 | ba81549029b71 |
13 | 471c9158bac23 |
14 | 1c26ca9b57685 |
15 | c3c86c0e7951 |
hex | 606a60d6f545 |
106010007500101 has 2 divisors, whose sum is σ = 106010007500102. Its totient is φ = 106010007500100.
The previous prime is 106010007500017. The next prime is 106010007500141. The reversal of 106010007500101 is 101005700010601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 85305450849025 + 20704556651076 = 9236095^2 + 4550226^2 .
It is a cyclic number.
It is not a de Polignac number, because 106010007500101 - 235 = 105975647761733 is a prime.
It is a super-2 number, since 2×1060100075001012 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106010007500141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53005003750050 + 53005003750051.
It is an arithmetic number, because the mean of its divisors is an integer number (53005003750051).
Almost surely, 2106010007500101 is an apocalyptic number.
It is an amenable number.
106010007500101 is a deficient number, since it is larger than the sum of its proper divisors (1).
106010007500101 is an equidigital number, since it uses as much as digits as its factorization.
106010007500101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 210, while the sum is 22.
Adding to 106010007500101 its reverse (101005700010601), we get a palindrome (207015707510702).
The spelling of 106010007500101 in words is "one hundred six trillion, ten billion, seven million, five hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •