Base | Representation |
---|---|
bin | 110000111001110101… |
… | …1111110000001010001 |
3 | 101001002000212220212101 |
4 | 1201303223332001101 |
5 | 3210040122334134 |
6 | 120125013400401 |
7 | 10405332205165 |
oct | 1416353760121 |
9 | 331060786771 |
10 | 105020121169 |
11 | 405a2136477 |
12 | 1842b039101 |
13 | 9b98894942 |
14 | 5123a7cca5 |
15 | 2ae9d17e14 |
hex | 1873afe051 |
105020121169 has 2 divisors, whose sum is σ = 105020121170. Its totient is φ = 105020121168.
The previous prime is 105020121119. The next prime is 105020121229. The reversal of 105020121169 is 961121020501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64079859600 + 40940261569 = 253140^2 + 202337^2 .
It is a cyclic number.
It is not a de Polignac number, because 105020121169 - 29 = 105020120657 is a prime.
It is a super-2 number, since 2×1050201211692 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105020121109) 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, 52510060584 + 52510060585.
It is an arithmetic number, because the mean of its divisors is an integer number (52510060585).
Almost surely, 2105020121169 is an apocalyptic number.
It is an amenable number.
105020121169 is a deficient number, since it is larger than the sum of its proper divisors (1).
105020121169 is an equidigital number, since it uses as much as digits as its factorization.
105020121169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 28.
The spelling of 105020121169 in words is "one hundred five billion, twenty million, one hundred twenty-one thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •