Base | Representation |
---|---|
bin | 101010010111001… |
… | …0011101000110101 |
3 | 10200001122212210222 |
4 | 1110232103220311 |
5 | 10402341101310 |
6 | 353014024125 |
7 | 50136625544 |
oct | 12456235065 |
9 | 3601585728 |
10 | 1421425205 |
11 | 66a3a2882 |
12 | 338048045 |
13 | 198640805 |
14 | d6acc15b |
15 | 84bc8055 |
hex | 54b93a35 |
1421425205 has 8 divisors (see below), whose sum is σ = 1706170272. Its totient is φ = 1136833488.
The previous prime is 1421425177. The next prime is 1421425241. The reversal of 1421425205 is 5025241241.
1421425205 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1421425205 - 224 = 1404647989 is a prime.
It is a super-2 number, since 2×14214252052 = 4040899226818584050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16847 + ... + 55916.
It is an arithmetic number, because the mean of its divisors is an integer number (213271284).
Almost surely, 21421425205 is an apocalyptic number.
It is an amenable number.
1421425205 is a deficient number, since it is larger than the sum of its proper divisors (284745067).
1421425205 is an equidigital number, since it uses as much as digits as its factorization.
1421425205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76675.
The product of its (nonzero) digits is 3200, while the sum is 26.
The square root of 1421425205 is about 37701.7931271180. The cubic root of 1421425205 is about 1124.3667758276.
Adding to 1421425205 its reverse (5025241241), we get a palindrome (6446666446).
The spelling of 1421425205 in words is "one billion, four hundred twenty-one million, four hundred twenty-five thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •