Base | Representation |
---|---|
bin | 100110110011100… |
… | …1000000001110011 |
3 | 10100202010122022212 |
4 | 1031213020001303 |
5 | 10131314232011 |
6 | 333112322335 |
7 | 44160454061 |
oct | 11547100163 |
9 | 3322118285 |
10 | 1302102131 |
11 | 609003670 |
12 | 3040a33ab |
13 | 1799c2a45 |
14 | c4d0b031 |
15 | 794a808b |
hex | 4d9c8073 |
1302102131 has 8 divisors (see below), whose sum is σ = 1504032624. Its totient is φ = 1114097920.
The previous prime is 1302102121. The next prime is 1302102133. The reversal of 1302102131 is 1312012031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1302102131 is a prime.
It is a super-2 number, since 2×13021021312 = 3390939919109482322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1302102133) 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, 3481370 + ... + 3481743.
It is an arithmetic number, because the mean of its divisors is an integer number (188004078).
Almost surely, 21302102131 is an apocalyptic number.
1302102131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1302102131 is a deficient number, since it is larger than the sum of its proper divisors (201930493).
1302102131 is a wasteful number, since it uses less digits than its factorization.
1302102131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6963141.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 1302102131 is about 36084.6522915214. The cubic root of 1302102131 is about 1091.9808357029.
Adding to 1302102131 its reverse (1312012031), we get a palindrome (2614114162).
The spelling of 1302102131 in words is "one billion, three hundred two million, one hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •