Base | Representation |
---|---|
bin | 10100100011001111000… |
… | …111111000000000101011 |
3 | 12000000012100000120112012 |
4 | 110203033013320000223 |
5 | 141114213400034402 |
6 | 3000433350110135 |
7 | 204013142551001 |
oct | 24431707700053 |
9 | 5000170016465 |
10 | 1412224221227 |
11 | 4a4a14835666 |
12 | 1a984704b34b |
13 | a3231356581 |
14 | 4c4cdd12a71 |
15 | 26b06421452 |
hex | 148cf1f802b |
1412224221227 has 2 divisors, whose sum is σ = 1412224221228. Its totient is φ = 1412224221226.
The previous prime is 1412224221169. The next prime is 1412224221259. The reversal of 1412224221227 is 7221224222141.
It is an a-pointer prime, because the next prime (1412224221259) can be obtained adding 1412224221227 to its sum of digits (32).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1412224221227 - 220 = 1412223172651 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1412224221193 and 1412224221202.
It is not a weakly prime, because it can be changed into another prime (1412224226227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 706112110613 + 706112110614.
It is an arithmetic number, because the mean of its divisors is an integer number (706112110614).
Almost surely, 21412224221227 is an apocalyptic number.
1412224221227 is a deficient number, since it is larger than the sum of its proper divisors (1).
1412224221227 is an equidigital number, since it uses as much as digits as its factorization.
1412224221227 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14336, while the sum is 32.
Adding to 1412224221227 its reverse (7221224222141), we get a palindrome (8633448443368).
The spelling of 1412224221227 in words is "one trillion, four hundred twelve billion, two hundred twenty-four million, two hundred twenty-one thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •