Base | Representation |
---|---|
bin | 101010010110100… |
… | …0101110011101101 |
3 | 10200001001200111212 |
4 | 1110231011303231 |
5 | 10402300401123 |
6 | 353003124205 |
7 | 50134130246 |
oct | 12455056355 |
9 | 3601050455 |
10 | 1421106413 |
11 | 66a1a5311 |
12 | 337b13665 |
13 | 19855b68c |
14 | d6a47ccd |
15 | 84b63878 |
hex | 54b45ced |
1421106413 has 4 divisors (see below), whose sum is σ = 1421364768. Its totient is φ = 1420848060.
The previous prime is 1421106409. The next prime is 1421106469. The reversal of 1421106413 is 3146011241.
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 1421106413 - 22 = 1421106409 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 (1421106493) 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, 120743 + ... + 131988.
It is an arithmetic number, because the mean of its divisors is an integer number (355341192).
Almost surely, 21421106413 is an apocalyptic number.
It is an amenable number.
1421106413 is a deficient number, since it is larger than the sum of its proper divisors (258355).
1421106413 is an equidigital number, since it uses as much as digits as its factorization.
1421106413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258354.
The product of its (nonzero) digits is 576, while the sum is 23.
The square root of 1421106413 is about 37697.5650805195. The cubic root of 1421106413 is about 1124.2827132657.
Adding to 1421106413 its reverse (3146011241), we get a palindrome (4567117654).
The spelling of 1421106413 in words is "one billion, four hundred twenty-one million, one hundred six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •