Base | Representation |
---|---|
bin | 10011010111111111000… |
… | …100010011000101100101 |
3 | 11201021122020112210012222 |
4 | 103113333010103011211 |
5 | 133303224044230201 |
6 | 2455351533322125 |
7 | 165122635031642 |
oct | 23277704230545 |
9 | 4637566483188 |
10 | 1331424211301 |
11 | 473721291258 |
12 | 196057336345 |
13 | 98725567202 |
14 | 48626c08dc9 |
15 | 24977ac791b |
hex | 135ff113165 |
1331424211301 has 8 divisors (see below), whose sum is σ = 1471036469184. Its totient is φ = 1198622307520.
The previous prime is 1331424211279. The next prime is 1331424211303. The reversal of 1331424211301 is 1031124241331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1331424211301 is a prime.
It is a super-2 number, since 2×13314242113012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331424211303) 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, 1702588115 + ... + 1702588896.
It is an arithmetic number, because the mean of its divisors is an integer number (183879558648).
Almost surely, 21331424211301 is an apocalyptic number.
It is an amenable number.
1331424211301 is a deficient number, since it is larger than the sum of its proper divisors (139612257883).
1331424211301 is a wasteful number, since it uses less digits than its factorization.
1331424211301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3405177051.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 1331424211301 its reverse (1031124241331), we get a palindrome (2362548452632).
The spelling of 1331424211301 in words is "one trillion, three hundred thirty-one billion, four hundred twenty-four million, two hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •