Base | Representation |
---|---|
bin | 1001010110101011001… |
… | …11010011100000011111 |
3 | 1010201121201022101120000 |
4 | 10223111213103200133 |
5 | 20231222311233211 |
6 | 403353202225343 |
7 | 32135606036640 |
oct | 4532547234037 |
9 | 1121551271500 |
10 | 321411430431 |
11 | 114345411953 |
12 | 52360055253 |
13 | 24402a57980 |
14 | 117b0a736c7 |
15 | 85622cb656 |
hex | 4ad59d381f |
321411430431 has 80 divisors (see below), whose sum is σ = 603506770944. Its totient is φ = 165928378176.
The previous prime is 321411430409. The next prime is 321411430451. The reversal of 321411430431 is 134034114123.
321411430431 is a `hidden beast` number, since 3 + 214 + 1 + 14 + 3 + 0 + 431 = 666.
It is not a de Polignac number, because 321411430431 - 227 = 321277212703 is a prime.
It is a super-2 number, since 2×3214114304312 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 321411430395 and 321411430404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321411430451) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 117445 + ... + 810318.
Almost surely, 2321411430431 is an apocalyptic number.
321411430431 is a deficient number, since it is larger than the sum of its proper divisors (282095340513).
321411430431 is a wasteful number, since it uses less digits than its factorization.
321411430431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 927842 (or 927833 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 321411430431 its reverse (134034114123), we get a palindrome (455445544554).
The spelling of 321411430431 in words is "three hundred twenty-one billion, four hundred eleven million, four hundred thirty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •