Base | Representation |
---|---|
bin | 1001010111110111111… |
… | …11001110001001000001 |
3 | 1010210021120202000011211 |
4 | 10223323333032021001 |
5 | 20234032114442423 |
6 | 403541121210121 |
7 | 32160554215414 |
oct | 4537377161101 |
9 | 1123246660154 |
10 | 322055234113 |
11 | 114645869108 |
12 | 524bb790941 |
13 | 244a624c4b2 |
14 | 1183237db7b |
15 | 859da9d10d |
hex | 4afbfce241 |
322055234113 has 4 divisors (see below), whose sum is σ = 326862028720. Its totient is φ = 317248439508.
The previous prime is 322055234099. The next prime is 322055234131. The reversal of 322055234113 is 311432550223.
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: 311432550223 = 61 ⋅5105451643.
It is a cyclic number.
It is not a de Polignac number, because 322055234113 - 29 = 322055233601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (322055234173) 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, 2403397203 + ... + 2403397336.
It is an arithmetic number, because the mean of its divisors is an integer number (81715507180).
Almost surely, 2322055234113 is an apocalyptic number.
It is an amenable number.
322055234113 is a deficient number, since it is larger than the sum of its proper divisors (4806794607).
322055234113 is an equidigital number, since it uses as much as digits as its factorization.
322055234113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4806794606.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 322055234113 its reverse (311432550223), we get a palindrome (633487784336).
The spelling of 322055234113 in words is "three hundred twenty-two billion, fifty-five million, two hundred thirty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •