Base | Representation |
---|---|
bin | 101000011000101… |
… | …1001001010100011 |
3 | 10111102220111121001 |
4 | 1100301121022203 |
5 | 10233403003121 |
6 | 342245012431 |
7 | 45403242643 |
oct | 12061311243 |
9 | 3442814531 |
10 | 1355125411 |
11 | 635a29862 |
12 | 3199b4117 |
13 | 187999273 |
14 | cbd90523 |
15 | 7de7d991 |
hex | 50c592a3 |
1355125411 has 4 divisors (see below), whose sum is σ = 1356339712. Its totient is φ = 1353911112.
The previous prime is 1355125397. The next prime is 1355125417. The reversal of 1355125411 is 1145215531.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1145215531 = 12281 ⋅93251.
It is a cyclic number.
It is not a de Polignac number, because 1355125411 - 27 = 1355125283 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1355125411.
It is not an unprimeable number, because it can be changed into a prime (1355125417) 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 in 3 ways as a sum of consecutive naturals, for example, 605475 + ... + 607708.
It is an arithmetic number, because the mean of its divisors is an integer number (339084928).
Almost surely, 21355125411 is an apocalyptic number.
1355125411 is a deficient number, since it is larger than the sum of its proper divisors (1214301).
1355125411 is a wasteful number, since it uses less digits than its factorization.
1355125411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1214300.
The product of its digits is 3000, while the sum is 28.
The square root of 1355125411 is about 36812.0280750735. The cubic root of 1355125411 is about 1106.6063629117.
The spelling of 1355125411 in words is "one billion, three hundred fifty-five million, one hundred twenty-five thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •