Base | Representation |
---|---|
bin | 10110110000000101000100… |
… | …011011010100001010010011 |
3 | 111010021201221012122210101102 |
4 | 112300011010123110022103 |
5 | 101103344412240343232 |
6 | 552451220032055015 |
7 | 30035111613035441 |
oct | 2660050433241223 |
9 | 433251835583342 |
10 | 100061001106067 |
11 | 299786a55a3021 |
12 | b2805aa99446b |
13 | 43aa934109891 |
14 | 1a9cd9a61db91 |
15 | b87c39d71662 |
hex | 5b01446d4293 |
100061001106067 has 2 divisors, whose sum is σ = 100061001106068. Its totient is φ = 100061001106066.
The previous prime is 100061001106049. The next prime is 100061001106081. The reversal of 100061001106067 is 760601100160001.
It is a strong prime.
It is an emirp because it is prime and its reverse (760601100160001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100061001106067 - 214 = 100061001089683 is a prime.
It is not a weakly prime, because it can be changed into another prime (100061001106267) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50030500553033 + 50030500553034.
It is an arithmetic number, because the mean of its divisors is an integer number (50030500553034).
Almost surely, 2100061001106067 is an apocalyptic number.
100061001106067 is a deficient number, since it is larger than the sum of its proper divisors (1).
100061001106067 is an equidigital number, since it uses as much as digits as its factorization.
100061001106067 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 29.
Adding to 100061001106067 its reverse (760601100160001), we get a palindrome (860662101266068).
The spelling of 100061001106067 in words is "one hundred trillion, sixty-one billion, one million, one hundred six thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •