Base | Representation |
---|---|
bin | 101110010110001… |
… | …0101010001010011 |
3 | 11000101020112220111 |
4 | 1130230111101103 |
5 | 11141103002311 |
6 | 414151422151 |
7 | 53352230044 |
oct | 13454252123 |
9 | 4011215814 |
10 | 1555125331 |
11 | 728911751 |
12 | 374984957 |
13 | 1ba253506 |
14 | 10a7728cb |
15 | 917d7d21 |
hex | 5cb15453 |
1555125331 has 4 divisors (see below), whose sum is σ = 1588213152. Its totient is φ = 1522037512.
The previous prime is 1555125317. The next prime is 1555125343. The reversal of 1555125331 is 1335215551.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1335215551 = 571 ⋅2338381.
It is a cyclic number.
It is not a de Polignac number, because 1555125331 - 29 = 1555124819 is a prime.
It is a super-2 number, since 2×15551253312 = 4836829590235719122, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1555125293 and 1555125302.
It is not an unprimeable number, because it can be changed into a prime (1555125431) 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, 16543840 + ... + 16543933.
It is an arithmetic number, because the mean of its divisors is an integer number (397053288).
Almost surely, 21555125331 is an apocalyptic number.
1555125331 is a deficient number, since it is larger than the sum of its proper divisors (33087821).
1555125331 is an equidigital number, since it uses as much as digits as its factorization.
1555125331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33087820.
The product of its digits is 11250, while the sum is 31.
The square root of 1555125331 is about 39435.0774184608. The cubic root of 1555125331 is about 1158.5687190163.
The spelling of 1555125331 in words is "one billion, five hundred fifty-five million, one hundred twenty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.276 sec. • engine limits •