Base | Representation |
---|---|
bin | 110001001011001001… |
… | …1111000100110000011 |
3 | 101002120111221010121102 |
4 | 1202112103320212003 |
5 | 3212232324310201 |
6 | 120302404045015 |
7 | 10425614526605 |
oct | 1422623704603 |
9 | 332514833542 |
10 | 105601010051 |
11 | 40870020929 |
12 | 1857169376b |
13 | 9c5c02b884 |
14 | 517ac8d175 |
15 | 2b30d0d26b |
hex | 18964f8983 |
105601010051 has 2 divisors, whose sum is σ = 105601010052. Its totient is φ = 105601010050.
The previous prime is 105601010029. The next prime is 105601010129. The reversal of 105601010051 is 150010106501.
It is a weak prime.
It is an emirp because it is prime and its reverse (150010106501) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105601010051 is a prime.
It is a super-2 number, since 2×1056010100512 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105601010351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52800505025 + 52800505026.
It is an arithmetic number, because the mean of its divisors is an integer number (52800505026).
Almost surely, 2105601010051 is an apocalyptic number.
105601010051 is a deficient number, since it is larger than the sum of its proper divisors (1).
105601010051 is an equidigital number, since it uses as much as digits as its factorization.
105601010051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 105601010051 its reverse (150010106501), we get a palindrome (255611116552).
The spelling of 105601010051 in words is "one hundred five billion, six hundred one million, ten thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •