Base | Representation |
---|---|
bin | 100100001011101… |
… | …1110100101001001 |
3 | 10010121120101110200 |
4 | 1020113132211021 |
5 | 4441303122441 |
6 | 320250402413 |
7 | 42041541213 |
oct | 11027364511 |
9 | 3117511420 |
10 | 1214114121 |
11 | 573376a00 |
12 | 29a730409 |
13 | 1646c682c |
14 | b73655b3 |
15 | 718c77b6 |
hex | 485de949 |
1214114121 has 36 divisors (see below), whose sum is σ = 1934273796. Its totient is φ = 733296960.
The previous prime is 1214114053. The next prime is 1214114131.
1214114121 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 2 ways, for example, as 629006400 + 585107721 = 25080^2 + 24189^2 .
It is not a de Polignac number, because 1214114121 - 213 = 1214105929 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1214114094 and 1214114103.
It is not an unprimeable number, because it can be changed into a prime (1214114131) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 343455 + ... + 346971.
Almost surely, 21214114121 is an apocalyptic number.
1214114121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1214114121 is a deficient number, since it is larger than the sum of its proper divisors (720159675).
1214114121 is a wasteful number, since it uses less digits than its factorization.
1214114121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3862 (or 3848 counting only the distinct ones).
The product of its digits is 64, while the sum is 18.
The square root of 1214114121 is about 34844.1404112657. The cubic root of 1214114121 is about 1066.8085886140.
It can be divided in two parts, 12141 and 14121, that added together give a palindrome (26262).
The spelling of 1214114121 in words is "one billion, two hundred fourteen million, one hundred fourteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •