Base | Representation |
---|---|
bin | 1001010100010001100… |
… | …01110010000100010101 |
3 | 1010121021212122101010221 |
4 | 10222020301302010111 |
5 | 20221102304101123 |
6 | 403021232314341 |
7 | 32061633630523 |
oct | 4521061620425 |
9 | 1117255571127 |
10 | 320122331413 |
11 | 11384378a765 |
12 | 520603a29b1 |
13 | 242589686a1 |
14 | 116cb78d313 |
15 | 84d904125d |
hex | 4a88c72115 |
320122331413 has 4 divisors (see below), whose sum is σ = 320123969568. Its totient is φ = 320120693260.
The previous prime is 320122331377. The next prime is 320122331423. The reversal of 320122331413 is 314133221023.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 314133221023 = 2549 ⋅123237827.
It is a cyclic number.
It is not a de Polignac number, because 320122331413 - 29 = 320122330901 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320122331423) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 478843 + ... + 932488.
It is an arithmetic number, because the mean of its divisors is an integer number (80030992392).
Almost surely, 2320122331413 is an apocalyptic number.
It is an amenable number.
320122331413 is a deficient number, since it is larger than the sum of its proper divisors (1638155).
320122331413 is a wasteful number, since it uses less digits than its factorization.
320122331413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1638154.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 320122331413 its reverse (314133221023), we get a palindrome (634255552436).
The spelling of 320122331413 in words is "three hundred twenty billion, one hundred twenty-two million, three hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •