Base | Representation |
---|---|
bin | 101010000010001… |
… | …0100110110000111 |
3 | 10122021221202122121 |
4 | 1110010110312013 |
5 | 10342031420403 |
6 | 351542110411 |
7 | 46644241651 |
oct | 12404246607 |
9 | 3567852577 |
10 | 1410420103 |
11 | 664166554 |
12 | 33441b407 |
13 | 196289611 |
14 | d54656d1 |
15 | 83c523bd |
hex | 54114d87 |
1410420103 has 4 divisors (see below), whose sum is σ = 1484652760. Its totient is φ = 1336187448.
The previous prime is 1410420091. The next prime is 1410420127. The reversal of 1410420103 is 3010240141.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3010240141 = 181 ⋅16631161.
It is a cyclic number.
It is not a de Polignac number, because 1410420103 - 225 = 1376865671 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 (1410420163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 37116300 + ... + 37116337.
It is an arithmetic number, because the mean of its divisors is an integer number (371163190).
Almost surely, 21410420103 is an apocalyptic number.
1410420103 is a deficient number, since it is larger than the sum of its proper divisors (74232657).
1410420103 is an equidigital number, since it uses as much as digits as its factorization.
1410420103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74232656.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 1410420103 is about 37555.5602141680. The cubic root of 1410420103 is about 1121.4575260363.
Adding to 1410420103 its reverse (3010240141), we get a palindrome (4420660244).
The spelling of 1410420103 in words is "one billion, four hundred ten million, four hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •