Base | Representation |
---|---|
bin | 10011011111000101… |
… | …11001001101010101 |
3 | 1000000001212210011201 |
4 | 21233202321031111 |
5 | 132411101242124 |
6 | 4450023032501 |
7 | 520146013546 |
oct | 115742711525 |
9 | 30001783151 |
10 | 10461352789 |
11 | 4489185208 |
12 | 203b59b731 |
13 | ca94606a4 |
14 | 7135384cd |
15 | 413640144 |
hex | 26f8b9355 |
10461352789 has 2 divisors, whose sum is σ = 10461352790. Its totient is φ = 10461352788.
The previous prime is 10461352763. The next prime is 10461352793. The reversal of 10461352789 is 98725316401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10271822500 + 189530289 = 101350^2 + 13767^2 .
It is a cyclic number.
It is not a de Polignac number, because 10461352789 - 29 = 10461352277 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10461352189) 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 as a sum of consecutive naturals, namely, 5230676394 + 5230676395.
It is an arithmetic number, because the mean of its divisors is an integer number (5230676395).
It is a 1-persistent number, because it is pandigital, but 2⋅10461352789 = 20922705578 is not.
Almost surely, 210461352789 is an apocalyptic number.
It is an amenable number.
10461352789 is a deficient number, since it is larger than the sum of its proper divisors (1).
10461352789 is an equidigital number, since it uses as much as digits as its factorization.
10461352789 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 46.
It can be divided in two parts, 1046 and 1352789, that added together give a triangular number (1353835 = T1645).
The spelling of 10461352789 in words is "ten billion, four hundred sixty-one million, three hundred fifty-two thousand, seven hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •