Base | Representation |
---|---|
bin | 11000001111011000011100… |
… | …000111111010001000110011 |
3 | 111222110211102122211102121122 |
4 | 120033120130013322020303 |
5 | 102433200041403301444 |
6 | 1014424005443012455 |
7 | 31312220621440055 |
oct | 3017303407721063 |
9 | 458424378742548 |
10 | 106610150056499 |
11 | 30a73124427871 |
12 | bb5991766a12b |
13 | 47643a8c3c21b |
14 | 1c47d5cd098d5 |
15 | c4d2947244ee |
hex | 60f61c1fa233 |
106610150056499 has 2 divisors, whose sum is σ = 106610150056500. Its totient is φ = 106610150056498.
The previous prime is 106610150056379. The next prime is 106610150056511. The reversal of 106610150056499 is 994650051016601.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 106610150056499 - 216 = 106610149990963 is a prime.
It is a super-2 number, since 2×1066101500564992 (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 106610150056499.
It is not a weakly prime, because it can be changed into another prime (106610150056699) 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, 53305075028249 + 53305075028250.
It is an arithmetic number, because the mean of its divisors is an integer number (53305075028250).
Almost surely, 2106610150056499 is an apocalyptic number.
106610150056499 is a deficient number, since it is larger than the sum of its proper divisors (1).
106610150056499 is an equidigital number, since it uses as much as digits as its factorization.
106610150056499 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1749600, while the sum is 53.
The spelling of 106610150056499 in words is "one hundred six trillion, six hundred ten billion, one hundred fifty million, fifty-six thousand, four hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •