Base | Representation |
---|---|
bin | 100100001100001… |
… | …0101110101010001 |
3 | 10010121222212220121 |
4 | 1020120111311101 |
5 | 4441332343213 |
6 | 320255310241 |
7 | 42043503055 |
oct | 11030256521 |
9 | 3117885817 |
10 | 1214340433 |
11 | 573510a39 |
12 | 29a81b381 |
13 | 164775847 |
14 | b73c3c65 |
15 | 7191e88d |
hex | 48615d51 |
1214340433 has 2 divisors, whose sum is σ = 1214340434. Its totient is φ = 1214340432.
The previous prime is 1214340409. The next prime is 1214340451. The reversal of 1214340433 is 3340434121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 722964544 + 491375889 = 26888^2 + 22167^2 .
It is a cyclic number.
It is not a de Polignac number, because 1214340433 - 29 = 1214339921 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1214340398 and 1214340407.
It is not a weakly prime, because it can be changed into another prime (1214344433) 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 as a sum of consecutive naturals, namely, 607170216 + 607170217.
It is an arithmetic number, because the mean of its divisors is an integer number (607170217).
Almost surely, 21214340433 is an apocalyptic number.
It is an amenable number.
1214340433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1214340433 is an equidigital number, since it uses as much as digits as its factorization.
1214340433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 25.
The square root of 1214340433 is about 34847.3877500165. The cubic root of 1214340433 is about 1066.8748691999.
Adding to 1214340433 its reverse (3340434121), we get a palindrome (4554774554).
The spelling of 1214340433 in words is "one billion, two hundred fourteen million, three hundred forty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •