Base | Representation |
---|---|
bin | 110001001010001010… |
… | …0110111010010100101 |
3 | 101002111012021102211212 |
4 | 1202110110313102211 |
5 | 3212200313244141 |
6 | 120255214241205 |
7 | 10425031515143 |
oct | 1422424672245 |
9 | 332435242755 |
10 | 105567712421 |
11 | 40853248926 |
12 | 185624b6205 |
13 | 9c55170932 |
14 | 51766a2593 |
15 | 2b2ce322eb |
hex | 18945374a5 |
105567712421 has 2 divisors, whose sum is σ = 105567712422. Its totient is φ = 105567712420.
The previous prime is 105567712417. The next prime is 105567712423. The reversal of 105567712421 is 124217765501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82952064196 + 22615648225 = 288014^2 + 150385^2 .
It is a cyclic number.
It is not a de Polignac number, because 105567712421 - 22 = 105567712417 is a prime.
It is a super-2 number, since 2×1055677124212 (a number of 23 digits) contains 22 as substring.
Together with 105567712423, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105567712423) 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, 52783856210 + 52783856211.
It is an arithmetic number, because the mean of its divisors is an integer number (52783856211).
Almost surely, 2105567712421 is an apocalyptic number.
It is an amenable number.
105567712421 is a deficient number, since it is larger than the sum of its proper divisors (1).
105567712421 is an equidigital number, since it uses as much as digits as its factorization.
105567712421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 117600, while the sum is 41.
The spelling of 105567712421 in words is "one hundred five billion, five hundred sixty-seven million, seven hundred twelve thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •