Base | Representation |
---|---|
bin | 100110110011100… |
… | …1111001000000000 |
3 | 10100202012010012111 |
4 | 1031213033020000 |
5 | 10131321144300 |
6 | 333113105104 |
7 | 44160634606 |
oct | 11547171000 |
9 | 3322163174 |
10 | 1302131200 |
11 | 609023497 |
12 | 3040b8194 |
13 | 179a03046 |
14 | c4d17876 |
15 | 794b19ba |
hex | 4d9cf200 |
1302131200 has 120 divisors (see below), whose sum is σ = 3367159488. Its totient is φ = 498094080.
The previous prime is 1302131179. The next prime is 1302131213. The reversal of 1302131200 is 21312031.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 292189 + ... + 296611.
Almost surely, 21302131200 is an apocalyptic number.
1302131200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1302131200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1683579744).
1302131200 is an abundant number, since it is smaller than the sum of its proper divisors (2065028288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1302131200 is an equidigital number, since it uses as much as digits as its factorization.
1302131200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4474 (or 4453 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 1302131200 is about 36085.0550782453. The cubic root of 1302131200 is about 1091.9889616796.
Adding to 1302131200 its reverse (21312031), we get a palindrome (1323443231).
The spelling of 1302131200 in words is "one billion, three hundred two million, one hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •