Base | Representation |
---|---|
bin | 101010011100110… |
… | …1110111010010101 |
3 | 10200021022001120212 |
4 | 1110321232322111 |
5 | 10404122424001 |
6 | 353202135205 |
7 | 50204242310 |
oct | 12471567225 |
9 | 3607261525 |
10 | 1424420501 |
11 | 671059229 |
12 | 339051505 |
13 | 19914bc8a |
14 | d726b977 |
15 | 850ba7bb |
hex | 54e6ee95 |
1424420501 has 4 divisors (see below), whose sum is σ = 1627909152. Its totient is φ = 1220931852.
The previous prime is 1424420489. The next prime is 1424420507. The reversal of 1424420501 is 1050244241.
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: 1050244241 = 17 ⋅61779073.
It is a de Polignac number, because none of the positive numbers 2k-1424420501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1424420507) 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, 101744315 + ... + 101744328.
It is an arithmetic number, because the mean of its divisors is an integer number (406977288).
Almost surely, 21424420501 is an apocalyptic number.
It is an amenable number.
1424420501 is a deficient number, since it is larger than the sum of its proper divisors (203488651).
1424420501 is an equidigital number, since it uses as much as digits as its factorization.
1424420501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 203488650.
The product of its (nonzero) digits is 1280, while the sum is 23.
The square root of 1424420501 is about 37741.4957440746. The cubic root of 1424420501 is about 1125.1559950926.
Adding to 1424420501 its reverse (1050244241), we get a palindrome (2474664742).
The spelling of 1424420501 in words is "one billion, four hundred twenty-four million, four hundred twenty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •