Base | Representation |
---|---|
bin | 101010000111011… |
… | …1011100101100011 |
3 | 10122111012000021011 |
4 | 1110032323211203 |
5 | 10343234401402 |
6 | 352121441351 |
7 | 50010001165 |
oct | 12416734543 |
9 | 3574160234 |
10 | 1413200227 |
11 | 66579527a |
12 | 335340257 |
13 | 196a20b6a |
14 | d598a935 |
15 | 84100ed7 |
hex | 543bb963 |
1413200227 has 2 divisors, whose sum is σ = 1413200228. Its totient is φ = 1413200226.
The previous prime is 1413200179. The next prime is 1413200249. The reversal of 1413200227 is 7220023141.
It is an a-pointer prime, because the next prime (1413200249) can be obtained adding 1413200227 to its sum of digits (22).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1413200227 - 27 = 1413200099 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1413200198 and 1413200207.
It is not a weakly prime, because it can be changed into another prime (1413200287) 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 as a sum of consecutive naturals, namely, 706600113 + 706600114.
It is an arithmetic number, because the mean of its divisors is an integer number (706600114).
Almost surely, 21413200227 is an apocalyptic number.
1413200227 is a deficient number, since it is larger than the sum of its proper divisors (1).
1413200227 is an equidigital number, since it uses as much as digits as its factorization.
1413200227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 22.
The square root of 1413200227 is about 37592.5554731253. Note that the first 3 decimals coincide. The cubic root of 1413200227 is about 1122.1938893111.
Adding to 1413200227 its reverse (7220023141), we get a palindrome (8633223368).
The spelling of 1413200227 in words is "one billion, four hundred thirteen million, two hundred thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •