Base | Representation |
---|---|
bin | 101000010000001… |
… | …1010011110100101 |
3 | 10111010112100212121 |
4 | 1100200122132211 |
5 | 10231233034331 |
6 | 342005345541 |
7 | 45320354032 |
oct | 12040323645 |
9 | 3433470777 |
10 | 1350674341 |
11 | 633469695 |
12 | 3184082b1 |
13 | 186a9b2b3 |
14 | cb552389 |
15 | 7d89ec11 |
hex | 5081a7a5 |
1350674341 has 2 divisors, whose sum is σ = 1350674342. Its totient is φ = 1350674340.
The previous prime is 1350674317. The next prime is 1350674359. The reversal of 1350674341 is 1434760531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1202078241 + 148596100 = 34671^2 + 12190^2 .
It is an emirp because it is prime and its reverse (1434760531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1350674341 - 221 = 1348577189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1350674297 and 1350674306.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1350674041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 675337170 + 675337171.
It is an arithmetic number, because the mean of its divisors is an integer number (675337171).
Almost surely, 21350674341 is an apocalyptic number.
It is an amenable number.
1350674341 is a deficient number, since it is larger than the sum of its proper divisors (1).
1350674341 is an equidigital number, since it uses as much as digits as its factorization.
1350674341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30240, while the sum is 34.
The square root of 1350674341 is about 36751.5216147577. The cubic root of 1350674341 is about 1105.3934406999.
The spelling of 1350674341 in words is "one billion, three hundred fifty million, six hundred seventy-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •