Base | Representation |
---|---|
bin | 1100010010100111010… |
… | …10000010001110101001 |
3 | 1111101001112101012202021 |
4 | 12021103222002032221 |
5 | 23404342420314423 |
6 | 522001235504441 |
7 | 42340146342550 |
oct | 6112352021651 |
9 | 1441045335667 |
10 | 422310323113 |
11 | 153112193368 |
12 | 69a1aa58121 |
13 | 30a92863a73 |
14 | 16623242d97 |
15 | aeba3c495d |
hex | 6253a823a9 |
422310323113 has 4 divisors (see below), whose sum is σ = 482640369280. Its totient is φ = 361980276948.
The previous prime is 422310323101. The next prime is 422310323159. The reversal of 422310323113 is 311323013224.
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.
It is a cyclic number.
It is not a de Polignac number, because 422310323113 - 29 = 422310322601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (422310723113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30165023073 + ... + 30165023086.
It is an arithmetic number, because the mean of its divisors is an integer number (120660092320).
Almost surely, 2422310323113 is an apocalyptic number.
It is an amenable number.
422310323113 is a deficient number, since it is larger than the sum of its proper divisors (60330046167).
422310323113 is an equidigital number, since it uses as much as digits as its factorization.
422310323113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60330046166.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 422310323113 its reverse (311323013224), we get a palindrome (733633336337).
The spelling of 422310323113 in words is "four hundred twenty-two billion, three hundred ten million, three hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •