Base | Representation |
---|---|
bin | 110000111001100011… |
… | …1101001101001110001 |
3 | 101001001100222020001021 |
4 | 1201303013221221301 |
5 | 3210030203204221 |
6 | 120124033335441 |
7 | 10405155243256 |
oct | 1416307515161 |
9 | 331040866037 |
10 | 105010600561 |
11 | 405978234a9 |
12 | 18427a07581 |
13 | 9b96910349 |
14 | 51226c142d |
15 | 2ae9087041 |
hex | 18731e9a71 |
105010600561 has 4 divisors (see below), whose sum is σ = 105398093824. Its totient is φ = 104623107300.
The previous prime is 105010600531. The next prime is 105010600573. The reversal of 105010600561 is 165006010501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 105010600561 - 25 = 105010600529 is a prime.
It is a super-2 number, since 2×1050106005612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105010600511) 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 in 3 ways as a sum of consecutive naturals, for example, 193746225 + ... + 193746766.
It is an arithmetic number, because the mean of its divisors is an integer number (26349523456).
Almost surely, 2105010600561 is an apocalyptic number.
It is an amenable number.
105010600561 is a deficient number, since it is larger than the sum of its proper divisors (387493263).
105010600561 is an equidigital number, since it uses as much as digits as its factorization.
105010600561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 387493262.
The product of its (nonzero) digits is 900, while the sum is 25.
The spelling of 105010600561 in words is "one hundred five billion, ten million, six hundred thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •