Base | Representation |
---|---|
bin | 110001010111010110… |
… | …0101000011010111111 |
3 | 101010122000210121220202 |
4 | 1202232230220122333 |
5 | 3214102044304331 |
6 | 120411141234115 |
7 | 10442013261302 |
oct | 1425654503277 |
9 | 333560717822 |
10 | 106010150591 |
11 | 40a5aa6a204 |
12 | 1866670293b |
13 | 9cc5a20777 |
14 | 51b9352b39 |
15 | 2b56bc9ecb |
hex | 18aeb286bf |
106010150591 has 2 divisors, whose sum is σ = 106010150592. Its totient is φ = 106010150590.
The previous prime is 106010150531. The next prime is 106010150611. The reversal of 106010150591 is 195051010601.
It is a strong prime.
It is an emirp because it is prime and its reverse (195051010601) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106010150591 is a prime.
It is a super-2 number, since 2×1060101505912 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106010150531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53005075295 + 53005075296.
It is an arithmetic number, because the mean of its divisors is an integer number (53005075296).
Almost surely, 2106010150591 is an apocalyptic number.
106010150591 is a deficient number, since it is larger than the sum of its proper divisors (1).
106010150591 is an equidigital number, since it uses as much as digits as its factorization.
106010150591 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1350, while the sum is 29.
The spelling of 106010150591 in words is "one hundred six billion, ten million, one hundred fifty thousand, five hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •