Base | Representation |
---|---|
bin | 100110110011100… |
… | …1001111110110011 |
3 | 10100202011001022011 |
4 | 1031213021332303 |
5 | 10131320011011 |
6 | 333112423351 |
7 | 44160516310 |
oct | 11547117663 |
9 | 3322131264 |
10 | 1302110131 |
11 | 609009683 |
12 | 3040a7b57 |
13 | 1799c658a |
14 | c4d0dd07 |
15 | 794aa621 |
hex | 4d9c9fb3 |
1302110131 has 8 divisors (see below), whose sum is σ = 1490310144. Its totient is φ = 1114456200.
The previous prime is 1302110129. The next prime is 1302110141. The reversal of 1302110131 is 1310112031.
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 1302110131 - 21 = 1302110129 is a prime.
It is a super-2 number, since 2×13021101312 = 3390981586505674322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1302110101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 131395 + ... + 140956.
It is an arithmetic number, because the mean of its divisors is an integer number (186288768).
Almost surely, 21302110131 is an apocalyptic number.
1302110131 is a deficient number, since it is larger than the sum of its proper divisors (188200013).
1302110131 is an equidigital number, since it uses as much as digits as its factorization.
1302110131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273041.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1302110131 is about 36084.7631418027. The cubic root of 1302110131 is about 1091.9830720428.
Adding to 1302110131 its reverse (1310112031), we get a palindrome (2612222162).
The spelling of 1302110131 in words is "one billion, three hundred two million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •