Base | Representation |
---|---|
bin | 110000111101101101… |
… | …1100111001011110011 |
3 | 101001102002101001011112 |
4 | 1201323123213023303 |
5 | 3210321403113214 |
6 | 120145534303535 |
7 | 10411500454424 |
oct | 1417333471363 |
9 | 331362331145 |
10 | 105150051059 |
11 | 4065950a749 |
12 | 18466657bab |
13 | 9bb9787531 |
14 | 513702164b |
15 | 2b06430a3e |
hex | 187b6e72f3 |
105150051059 has 2 divisors, whose sum is σ = 105150051060. Its totient is φ = 105150051058.
The previous prime is 105150051029. The next prime is 105150051067. The reversal of 105150051059 is 950150051501.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105150051059 is a prime.
It is a super-2 number, since 2×1051500510592 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (105150051029) 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, 52575025529 + 52575025530.
It is an arithmetic number, because the mean of its divisors is an integer number (52575025530).
Almost surely, 2105150051059 is an apocalyptic number.
105150051059 is a deficient number, since it is larger than the sum of its proper divisors (1).
105150051059 is an equidigital number, since it uses as much as digits as its factorization.
105150051059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5625, while the sum is 32.
The spelling of 105150051059 in words is "one hundred five billion, one hundred fifty million, fifty-one thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •