Base | Representation |
---|---|
bin | 11101011010010001000… |
… | …01010011100111001001 |
3 | 10120121100212000100000112 |
4 | 32231020201103213021 |
5 | 113024033201131233 |
6 | 2052122150444105 |
7 | 133002655214306 |
oct | 16551041234711 |
9 | 3517325010015 |
10 | 1010534005193 |
11 | 35a624112a09 |
12 | 143a21963635 |
13 | 743a67b60cb |
14 | 36ca54940ad |
15 | 1b446458048 |
hex | eb488539c9 |
1010534005193 has 2 divisors, whose sum is σ = 1010534005194. Its totient is φ = 1010534005192.
The previous prime is 1010534005181. The next prime is 1010534005237. The reversal of 1010534005193 is 3915004350101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 874499911609 + 136034093584 = 935147^2 + 368828^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010534005193 - 210 = 1010534004169 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1010534005163) 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, 505267002596 + 505267002597.
It is an arithmetic number, because the mean of its divisors is an integer number (505267002597).
Almost surely, 21010534005193 is an apocalyptic number.
It is an amenable number.
1010534005193 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010534005193 is an equidigital number, since it uses as much as digits as its factorization.
1010534005193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8100, while the sum is 32.
Adding to 1010534005193 its reverse (3915004350101), we get a palindrome (4925538355294).
The spelling of 1010534005193 in words is "one trillion, ten billion, five hundred thirty-four million, five thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •