Base | Representation |
---|---|
bin | 100110110011110… |
… | …0000001100101011 |
3 | 10100202022200010112 |
4 | 1031213200030223 |
5 | 10131330414011 |
6 | 333114404535 |
7 | 44161345520 |
oct | 11547401453 |
9 | 3322280115 |
10 | 1302201131 |
11 | 609070a90 |
12 | 30413074b |
13 | 179a28b1a |
14 | c4d35147 |
15 | 794c758b |
hex | 4d9e032b |
1302201131 has 32 divisors (see below), whose sum is σ = 1653820416. Its totient is φ = 995904000.
The previous prime is 1302201101. The next prime is 1302201133. The reversal of 1302201131 is 1311022031.
It is not a de Polignac number, because 1302201131 - 214 = 1302184747 is a prime.
It is a super-2 number, since 2×13022011312 = 3391455571155358322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1302201133) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1710791 + ... + 1711551.
It is an arithmetic number, because the mean of its divisors is an integer number (51681888).
Almost surely, 21302201131 is an apocalyptic number.
1302201131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1302201131 is a deficient number, since it is larger than the sum of its proper divisors (351619285).
1302201131 is a wasteful number, since it uses less digits than its factorization.
1302201131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1163.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 1302201131 is about 36086.0240397858. The cubic root of 1302201131 is about 1092.0085097643.
Adding to 1302201131 its reverse (1311022031), we get a palindrome (2613223162).
Subtracting 1302201131 from its reverse (1311022031), we obtain a square (8820900 = 29702).
The spelling of 1302201131 in words is "one billion, three hundred two million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •