Base | Representation |
---|---|
bin | 101000011001001… |
… | …1100111101111011 |
3 | 10111110102121112222 |
4 | 1100302130331323 |
5 | 10233440400011 |
6 | 342254554255 |
7 | 45405510425 |
oct | 12062347573 |
9 | 3443377488 |
10 | 1355403131 |
11 | 6360a9485 |
12 | 319b0898b |
13 | 187a657b4 |
14 | cc023815 |
15 | 7ded5ddb |
hex | 50c9cf7b |
1355403131 has 4 divisors (see below), whose sum is σ = 1402141200. Its totient is φ = 1308665064.
The previous prime is 1355403121. The next prime is 1355403151. The reversal of 1355403131 is 1313045531.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1355403131 - 26 = 1355403067 is a prime.
It is a super-2 number, since 2×13554031312 = 3674235295049206322, which contains 22 as substring.
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 1355403131.
It is not an unprimeable number, because it can be changed into a prime (1355403121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23368991 + ... + 23369048.
It is an arithmetic number, because the mean of its divisors is an integer number (350535300).
Almost surely, 21355403131 is an apocalyptic number.
1355403131 is a deficient number, since it is larger than the sum of its proper divisors (46738069).
1355403131 is an equidigital number, since it uses as much as digits as its factorization.
1355403131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46738068.
The product of its (nonzero) digits is 2700, while the sum is 26.
The square root of 1355403131 is about 36815.8000184703. The cubic root of 1355403131 is about 1106.6819538803.
Adding to 1355403131 its reverse (1313045531), we get a palindrome (2668448662).
The spelling of 1355403131 in words is "one billion, three hundred fifty-five million, four hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •