Base | Representation |
---|---|
bin | 1100010011000011001… |
… | …11010111001010010011 |
3 | 1111101122212000210202211 |
4 | 12021201213113022103 |
5 | 23410332343102233 |
6 | 522040403052551 |
7 | 42346022006206 |
oct | 6114147271223 |
9 | 1441585023684 |
10 | 422544503443 |
11 | 1532223a1527 |
12 | 69a85371157 |
13 | 30acc2279ca |
14 | 166463a193d |
15 | aed0c315cd |
hex | 62619d7293 |
422544503443 has 4 divisors (see below), whose sum is σ = 436174971328. Its totient is φ = 408914035560.
The previous prime is 422544503389. The next prime is 422544503483. The reversal of 422544503443 is 344305445224.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-422544503443 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 422544503396 and 422544503405.
It is not an unprimeable number, because it can be changed into a prime (422544503483) 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, 6815233896 + ... + 6815233957.
It is an arithmetic number, because the mean of its divisors is an integer number (109043742832).
Almost surely, 2422544503443 is an apocalyptic number.
422544503443 is a deficient number, since it is larger than the sum of its proper divisors (13630467885).
422544503443 is a wasteful number, since it uses less digits than its factorization.
422544503443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13630467884.
The product of its (nonzero) digits is 921600, while the sum is 40.
Adding to 422544503443 its reverse (344305445224), we get a palindrome (766849948667).
The spelling of 422544503443 in words is "four hundred twenty-two billion, five hundred forty-four million, five hundred three thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •