Base | Representation |
---|---|
bin | 110001001001101011… |
… | …0000110100110011111 |
3 | 101002110001022120110021 |
4 | 1202103112012212133 |
5 | 3212132110310223 |
6 | 120253425453011 |
7 | 10424441623114 |
oct | 1422326064637 |
9 | 332401276407 |
10 | 105551260063 |
11 | 40844a30a37 |
12 | 18558aa1167 |
13 | 9c51930202 |
14 | 517441c90b |
15 | 2b2b78265d |
hex | 189358699f |
105551260063 has 4 divisors (see below), whose sum is σ = 111106589560. Its totient is φ = 99995930568.
The previous prime is 105551260051. The next prime is 105551260069. The reversal of 105551260063 is 360062155501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 360062155501 = 7043 ⋅51123407.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105551260063 is a prime.
It is a super-2 number, since 2×1055512600632 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105551260069) 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, 2777664720 + ... + 2777664757.
It is an arithmetic number, because the mean of its divisors is an integer number (27776647390).
Almost surely, 2105551260063 is an apocalyptic number.
105551260063 is a deficient number, since it is larger than the sum of its proper divisors (5555329497).
105551260063 is an equidigital number, since it uses as much as digits as its factorization.
105551260063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5555329496.
The product of its (nonzero) digits is 27000, while the sum is 34.
The spelling of 105551260063 in words is "one hundred five billion, five hundred fifty-one million, two hundred sixty thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •