Base | Representation |
---|---|
bin | 100001110011110… |
… | …1001000001101011 |
3 | 2221001200210121002 |
4 | 1003213221001223 |
5 | 4310410341011 |
6 | 304323305215 |
7 | 40053536342 |
oct | 10347510153 |
9 | 2831623532 |
10 | 1134465131 |
11 | 532415498 |
12 | 277b1b20b |
13 | 15105a157 |
14 | aa950b59 |
15 | 698e2c3b |
hex | 439e906b |
1134465131 has 4 divisors (see below), whose sum is σ = 1201198392. Its totient is φ = 1067731872.
The previous prime is 1134465127. The next prime is 1134465139. The reversal of 1134465131 is 1315644311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1315644311 = 10837 ⋅121403.
It is a cyclic number.
It is not a de Polignac number, because 1134465131 - 22 = 1134465127 is a prime.
It is a super-2 number, since 2×11344651312 = 2574022266909694322, 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 = 1134465094 and 1134465103.
It is not an unprimeable number, because it can be changed into a prime (1134465139) 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, 33366605 + ... + 33366638.
It is an arithmetic number, because the mean of its divisors is an integer number (300299598).
Almost surely, 21134465131 is an apocalyptic number.
1134465131 is a deficient number, since it is larger than the sum of its proper divisors (66733261).
1134465131 is an equidigital number, since it uses as much as digits as its factorization.
1134465131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66733260.
The product of its digits is 4320, while the sum is 29.
The square root of 1134465131 is about 33681.8219667523. The cubic root of 1134465131 is about 1042.9505496163.
The spelling of 1134465131 in words is "one billion, one hundred thirty-four million, four hundred sixty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •