Base | Representation |
---|---|
bin | 101010011100111… |
… | …0010001110110101 |
3 | 10200021022202020120 |
4 | 1110321302032311 |
5 | 10404123342401 |
6 | 353202322153 |
7 | 50204330046 |
oct | 12471621665 |
9 | 3607282216 |
10 | 1424434101 |
11 | 671068472 |
12 | 339059359 |
13 | 19915521c |
14 | d72728cd |
15 | 850be836 |
hex | 54e723b5 |
1424434101 has 4 divisors (see below), whose sum is σ = 1899245472. Its totient is φ = 949622732.
The previous prime is 1424434061. The next prime is 1424434117. The reversal of 1424434101 is 1014344241.
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 1424434101 - 29 = 1424433589 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1424434171) 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, 237405681 + ... + 237405686.
It is an arithmetic number, because the mean of its divisors is an integer number (474811368).
Almost surely, 21424434101 is an apocalyptic number.
It is an amenable number.
1424434101 is a deficient number, since it is larger than the sum of its proper divisors (474811371).
1424434101 is an equidigital number, since it uses as much as digits as its factorization.
1424434101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 474811370.
The product of its (nonzero) digits is 1536, while the sum is 24.
The square root of 1424434101 is about 37741.6759166839. The cubic root of 1424434101 is about 1125.1595759811.
Adding to 1424434101 its reverse (1014344241), we get a palindrome (2438778342).
The spelling of 1424434101 in words is "one billion, four hundred twenty-four million, four hundred thirty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.074 sec. • engine limits •