Base | Representation |
---|---|
bin | 101010001001011… |
… | …0010101000000111 |
3 | 10122120002102022001 |
4 | 1110102302220013 |
5 | 10344014241403 |
6 | 352155250131 |
7 | 50021414233 |
oct | 12422625007 |
9 | 3576072261 |
10 | 1414212103 |
11 | 666316537 |
12 | 335749947 |
13 | 196cb65c5 |
14 | d5b715c3 |
15 | 84250c1d |
hex | 544b2a07 |
1414212103 has 4 divisors (see below), whose sum is σ = 1414289920. Its totient is φ = 1414134288.
The previous prime is 1414212077. The next prime is 1414212119. The reversal of 1414212103 is 3012124141.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 1414212103 - 25 = 1414212071 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 (1414210103) 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, 4483 + ... + 53371.
It is an arithmetic number, because the mean of its divisors is an integer number (353572480).
Almost surely, 21414212103 is an apocalyptic number.
1414212103 is a deficient number, since it is larger than the sum of its proper divisors (77817).
1414212103 is an equidigital number, since it uses as much as digits as its factorization.
1414212103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77816.
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 1414212103 is about 37606.0115274141. The cubic root of 1414212103 is about 1122.4616622075.
Adding to 1414212103 its reverse (3012124141), we get a palindrome (4426336244).
The spelling of 1414212103 in words is "one billion, four hundred fourteen million, two hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •