Base | Representation |
---|---|
bin | 110000111001100010… |
… | …1101111111000001001 |
3 | 101001001100000212211111 |
4 | 1201303011233320021 |
5 | 3210030041224034 |
6 | 120124014530321 |
7 | 10405151065126 |
oct | 1416305577011 |
9 | 331040025744 |
10 | 105010101769 |
11 | 40597512781 |
12 | 184278069a1 |
13 | 9b967972c1 |
14 | 51225d174d |
15 | 2ae8ed9364 |
hex | 187316fe09 |
105010101769 has 2 divisors, whose sum is σ = 105010101770. Its totient is φ = 105010101768.
The previous prime is 105010101671. The next prime is 105010101811. The reversal of 105010101769 is 967101010501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102024025744 + 2986076025 = 319412^2 + 54645^2 .
It is a cyclic number.
It is not a de Polignac number, because 105010101769 - 213 = 105010093577 is a prime.
It is a super-2 number, since 2×1050101017692 (a number of 23 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 105010101769.
It is not a weakly prime, because it can be changed into another prime (105010101169) 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, 52505050884 + 52505050885.
It is an arithmetic number, because the mean of its divisors is an integer number (52505050885).
Almost surely, 2105010101769 is an apocalyptic number.
It is an amenable number.
105010101769 is a deficient number, since it is larger than the sum of its proper divisors (1).
105010101769 is an equidigital number, since it uses as much as digits as its factorization.
105010101769 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1890, while the sum is 31.
The spelling of 105010101769 in words is "one hundred five billion, ten million, one hundred one thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •