Base | Representation |
---|---|
bin | 1100010010000111010… |
… | …10111001010011000111 |
3 | 1111100100211200201221122 |
4 | 12021003222321103013 |
5 | 23403320240110343 |
6 | 521514455104155 |
7 | 42330411525533 |
oct | 6110352712307 |
9 | 1440324621848 |
10 | 422042113223 |
11 | 152a948522a5 |
12 | 6996507205b |
13 | 30a4c1169a3 |
14 | 165d9786bc3 |
15 | aea1a95068 |
hex | 6243ab94c7 |
422042113223 has 4 divisors (see below), whose sum is σ = 422048627280. Its totient is φ = 422035599168.
The previous prime is 422042113183. The next prime is 422042113243. The reversal of 422042113223 is 322311240224.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 422042113223 - 26 = 422042113159 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 422042113192 and 422042113201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (422042113243) 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 3 ways as a sum of consecutive naturals, for example, 3158858 + ... + 3289751.
It is an arithmetic number, because the mean of its divisors is an integer number (105512156820).
Almost surely, 2422042113223 is an apocalyptic number.
422042113223 is a deficient number, since it is larger than the sum of its proper divisors (6514057).
422042113223 is an equidigital number, since it uses as much as digits as its factorization.
422042113223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6514056.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 422042113223 its reverse (322311240224), we get a palindrome (744353353447).
The spelling of 422042113223 in words is "four hundred twenty-two billion, forty-two million, one hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •