Base | Representation |
---|---|
bin | 10011011110000110… |
… | …11010100000010001 |
3 | 222222111100112020122 |
4 | 21233003122200101 |
5 | 132401443204221 |
6 | 4445130120025 |
7 | 520015613561 |
oct | 115703324021 |
9 | 28874315218 |
10 | 10453100561 |
11 | 4484559192 |
12 | 2038880015 |
13 | ca7831507 |
14 | 7123cada1 |
15 | 412a5eeab |
hex | 26f0da811 |
10453100561 has 2 divisors, whose sum is σ = 10453100562. Its totient is φ = 10453100560.
The previous prime is 10453100509. The next prime is 10453100563. The reversal of 10453100561 is 16500135401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10006200961 + 446899600 = 100031^2 + 21140^2 .
It is a cyclic number.
It is not a de Polignac number, because 10453100561 - 226 = 10385991697 is a prime.
It is a super-2 number, since 2×104531005612 (a number of 21 digits) contains 22 as substring.
Together with 10453100563, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10453100561.
It is not a weakly prime, because it can be changed into another prime (10453100563) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5226550280 + 5226550281.
It is an arithmetic number, because the mean of its divisors is an integer number (5226550281).
Almost surely, 210453100561 is an apocalyptic number.
It is an amenable number.
10453100561 is a deficient number, since it is larger than the sum of its proper divisors (1).
10453100561 is an equidigital number, since it uses as much as digits as its factorization.
10453100561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 10453100561 its reverse (16500135401), we get a palindrome (26953235962).
The spelling of 10453100561 in words is "ten billion, four hundred fifty-three million, one hundred thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •