Base | Representation |
---|---|
bin | 10010111110110000010… |
… | …001010100101111110011 |
3 | 11121200201011120022010002 |
4 | 102332300101110233303 |
5 | 132332233100002011 |
6 | 2435111350300215 |
7 | 163143400441604 |
oct | 22766021245763 |
9 | 4550634508102 |
10 | 1304332422131 |
11 | 463189715052 |
12 | 19095635766b |
13 | 95cc885922b |
14 | 471b6b11dab |
15 | 23dde460c3b |
hex | 12fb0454bf3 |
1304332422131 has 16 divisors (see below), whose sum is σ = 1390455360000. Its totient is φ = 1219958996256.
The previous prime is 1304332422119. The next prime is 1304332422179. The reversal of 1304332422131 is 1312242334031.
It is not a de Polignac number, because 1304332422131 - 210 = 1304332421107 is a prime.
It is a super-5 number, since 5×13043324221315 (a number of 62 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1304332422094 and 1304332422103.
It is not an unprimeable number, because it can be changed into a prime (1304332425131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 43377380 + ... + 43407438.
It is an arithmetic number, because the mean of its divisors is an integer number (86903460000).
Almost surely, 21304332422131 is an apocalyptic number.
1304332422131 is a deficient number, since it is larger than the sum of its proper divisors (86122937869).
1304332422131 is a wasteful number, since it uses less digits than its factorization.
1304332422131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59066.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 1304332422131 its reverse (1312242334031), we get a palindrome (2616574756162).
The spelling of 1304332422131 in words is "one trillion, three hundred four billion, three hundred thirty-two million, four hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •