Base | Representation |
---|---|
bin | 1001100101001010010011… |
… | …1010100101010100001001 |
3 | 1101022001011102112212221121 |
4 | 2121102210322211110021 |
5 | 2340042141304133114 |
6 | 34223133125035241 |
7 | 2135025666662032 |
oct | 231224472452411 |
9 | 41261142485847 |
10 | 10534026630409 |
11 | 33a1501458577 |
12 | 1221694255b21 |
13 | 5b547b955119 |
14 | 285bc7483a89 |
15 | 134032e35a24 |
hex | 994a4ea5509 |
10534026630409 has 2 divisors, whose sum is σ = 10534026630410. Its totient is φ = 10534026630408.
The previous prime is 10534026630341. The next prime is 10534026630451. The reversal of 10534026630409 is 90403662043501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6548301871225 + 3985724759184 = 2558965^2 + 1996428^2 .
It is a cyclic number.
It is not a de Polignac number, because 10534026630409 - 211 = 10534026628361 is a prime.
It is a super-2 number, since 2×105340266304092 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10534026634409) 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, 5267013315204 + 5267013315205.
It is an arithmetic number, because the mean of its divisors is an integer number (5267013315205).
Almost surely, 210534026630409 is an apocalyptic number.
It is an amenable number.
10534026630409 is a deficient number, since it is larger than the sum of its proper divisors (1).
10534026630409 is an equidigital number, since it uses as much as digits as its factorization.
10534026630409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 466560, while the sum is 43.
The spelling of 10534026630409 in words is "ten trillion, five hundred thirty-four billion, twenty-six million, six hundred thirty thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •