Base | Representation |
---|---|
bin | 100111000010111… |
… | …0000011110100011 |
3 | 10101022020121102021 |
4 | 1032011300132203 |
5 | 10140343212011 |
6 | 334000402311 |
7 | 44315640130 |
oct | 11605603643 |
9 | 3338217367 |
10 | 1310132131 |
11 | 612598730 |
12 | 306916397 |
13 | 17b574a19 |
14 | c5ddb587 |
15 | 7a042471 |
hex | 4e1707a3 |
1310132131 has 8 divisors (see below), whose sum is σ = 1633411584. Its totient is φ = 1020882120.
The previous prime is 1310132123. The next prime is 1310132143. The reversal of 1310132131 is 1312310131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1310132131 - 23 = 1310132123 is a prime.
It is a super-2 number, since 2×13101321312 = 3432892401357202322, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1310132171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8507275 + ... + 8507428.
It is an arithmetic number, because the mean of its divisors is an integer number (204176448).
Almost surely, 21310132131 is an apocalyptic number.
1310132131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1310132131 is a deficient number, since it is larger than the sum of its proper divisors (323279453).
1310132131 is a wasteful number, since it uses less digits than its factorization.
1310132131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17014721.
The product of its (nonzero) digits is 54, while the sum is 16.
The square root of 1310132131 is about 36195.7474159603. The cubic root of 1310132131 is about 1094.2209678240.
Adding to 1310132131 its reverse (1312310131), we get a palindrome (2622442262).
The spelling of 1310132131 in words is "one billion, three hundred ten million, one hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •