Base | Representation |
---|---|
bin | 1100010010000100110… |
… | …01100111011100000011 |
3 | 1111100022100121020111011 |
4 | 12021002121213130003 |
5 | 23403244311301103 |
6 | 521512414301351 |
7 | 42330032444530 |
oct | 6110231473403 |
9 | 1440270536434 |
10 | 422020806403 |
11 | 152a8381a159 |
12 | 69959ab7857 |
13 | 30a478967c1 |
14 | 165d69dbd87 |
15 | ae9ec86d6d |
hex | 6242667703 |
422020806403 has 4 divisors (see below), whose sum is σ = 482309493040. Its totient is φ = 361732119768.
The previous prime is 422020806379. The next prime is 422020806413. The reversal of 422020806403 is 304608020224.
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 422020806403 - 29 = 422020805891 is a prime.
It is a super-2 number, since 2×4220208064032 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (422020806413) 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, 30144343308 + ... + 30144343321.
It is an arithmetic number, because the mean of its divisors is an integer number (120577373260).
Almost surely, 2422020806403 is an apocalyptic number.
422020806403 is a deficient number, since it is larger than the sum of its proper divisors (60288686637).
422020806403 is an equidigital number, since it uses as much as digits as its factorization.
422020806403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60288686636.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 422020806403 its reverse (304608020224), we get a palindrome (726628826627).
The spelling of 422020806403 in words is "four hundred twenty-two billion, twenty million, eight hundred six thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •