Base | Representation |
---|---|
bin | 10011101001100100010… |
… | …110101111100100000101 |
3 | 11210002100222002200100022 |
4 | 103221210112233210011 |
5 | 134110410133231113 |
6 | 2512153144224525 |
7 | 166361530434533 |
oct | 23514426574405 |
9 | 4702328080308 |
10 | 1350303414533 |
11 | 48072a091057 |
12 | 199845a6b145 |
13 | 9a44398c198 |
14 | 494d82db153 |
15 | 251d0250908 |
hex | 13a645af905 |
1350303414533 has 2 divisors, whose sum is σ = 1350303414534. Its totient is φ = 1350303414532.
The previous prime is 1350303414463. The next prime is 1350303414571. The reversal of 1350303414533 is 3354143030531.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1204282370404 + 146021044129 = 1097398^2 + 382127^2 .
It is a cyclic number.
It is not a de Polignac number, because 1350303414533 - 212 = 1350303410437 is a prime.
It is a super-2 number, since 2×13503034145332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1350303414493 and 1350303414502.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1350303414583) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 675151707266 + 675151707267.
It is an arithmetic number, because the mean of its divisors is an integer number (675151707267).
Almost surely, 21350303414533 is an apocalyptic number.
It is an amenable number.
1350303414533 is a deficient number, since it is larger than the sum of its proper divisors (1).
1350303414533 is an equidigital number, since it uses as much as digits as its factorization.
1350303414533 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 97200, while the sum is 35.
The spelling of 1350303414533 in words is "one trillion, three hundred fifty billion, three hundred three million, four hundred fourteen thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •