Base | Representation |
---|---|
bin | 10100011001001011111… |
… | …000000010110100110011 |
3 | 11221222100020011020222001 |
4 | 110121023320002310303 |
5 | 140430113133240311 |
6 | 2551450434154431 |
7 | 203151541120000 |
oct | 24311370026463 |
9 | 4858306136861 |
10 | 1401432321331 |
11 | 4a0387012529 |
12 | 1a7734a22a17 |
13 | a22015910a3 |
14 | 4bb889328a7 |
15 | 266c3c8b4c1 |
hex | 1464be02d33 |
1401432321331 has 20 divisors (see below), whose sum is σ = 1635060961064. Its totient is φ = 1201114656000.
The previous prime is 1401432321277. The next prime is 1401432321337. The reversal of 1401432321331 is 1331232341041.
It is not a de Polignac number, because 1401432321331 - 211 = 1401432319283 is a prime.
It is a super-2 number, since 2×14014323213312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1401432321331.
It is not an unprimeable number, because it can be changed into a prime (1401432321337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 34556536 + ... + 34597066.
Almost surely, 21401432321331 is an apocalyptic number.
1401432321331 is a deficient number, since it is larger than the sum of its proper divisors (233628639733).
1401432321331 is an frugal number, since it uses more digits than its factorization.
1401432321331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54960 (or 54939 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 1401432321331 its reverse (1331232341041), we get a palindrome (2732664662372).
The spelling of 1401432321331 in words is "one trillion, four hundred one billion, four hundred thirty-two million, three hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •