Base | Representation |
---|---|
bin | 11000000111011000100011… |
… | …000001110111011001010111 |
3 | 111220112021201022021121020212 |
4 | 120013120203001313121113 |
5 | 102400143411041132111 |
6 | 1013323305315120035 |
7 | 31224422212046345 |
oct | 3007304301673127 |
9 | 456467638247225 |
10 | 106060510099031 |
11 | 30881011a60634 |
12 | ba8b2a22a301b |
13 | 4724603812967 |
14 | 1c294db118995 |
15 | c3dd25b6a98b |
hex | 607623077657 |
106060510099031 has 2 divisors, whose sum is σ = 106060510099032. Its totient is φ = 106060510099030.
The previous prime is 106060510099003. The next prime is 106060510099079. The reversal of 106060510099031 is 130990015060601.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 106060510099031 - 226 = 106060442990167 is a prime.
It is a super-2 number, since 2×1060605100990312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106060510099031.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106060510099331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53030255049515 + 53030255049516.
It is an arithmetic number, because the mean of its divisors is an integer number (53030255049516).
Almost surely, 2106060510099031 is an apocalyptic number.
106060510099031 is a deficient number, since it is larger than the sum of its proper divisors (1).
106060510099031 is an equidigital number, since it uses as much as digits as its factorization.
106060510099031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43740, while the sum is 41.
The spelling of 106060510099031 in words is "one hundred six trillion, sixty billion, five hundred ten million, ninety-nine thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •