Base | Representation |
---|---|
bin | 100111101001110… |
… | …1010110011100011 |
3 | 10102201200020212201 |
4 | 1033103222303203 |
5 | 10211110244011 |
6 | 340010234031 |
7 | 44654353252 |
oct | 11723526343 |
9 | 3381606781 |
10 | 1330556131 |
11 | 623078573 |
12 | 311725917 |
13 | 182876128 |
14 | c89d6799 |
15 | 7bc28cc1 |
hex | 4f4eace3 |
1330556131 has 4 divisors (see below), whose sum is σ = 1330910352. Its totient is φ = 1330201912.
The previous prime is 1330556107. The next prime is 1330556137. The reversal of 1330556131 is 1316550331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1316550331 = 1753 ⋅751027.
It is a cyclic number.
It is not a de Polignac number, because 1330556131 - 221 = 1328458979 is a prime.
It is a super-2 number, since 2×13305561312 = 3540759235483378322, 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 1330556131.
It is not an unprimeable number, because it can be changed into a prime (1330556137) 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, 171415 + ... + 179008.
It is an arithmetic number, because the mean of its divisors is an integer number (332727588).
Almost surely, 21330556131 is an apocalyptic number.
1330556131 is a deficient number, since it is larger than the sum of its proper divisors (354221).
1330556131 is an equidigital number, since it uses as much as digits as its factorization.
1330556131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 354220.
The product of its (nonzero) digits is 4050, while the sum is 28.
The square root of 1330556131 is about 36476.7889348830. The cubic root of 1330556131 is about 1099.8777084434.
The spelling of 1330556131 in words is "one billion, three hundred thirty million, five hundred fifty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •