Base | Representation |
---|---|
bin | 1000010010101111… |
… | …00101011111010111 |
3 | 102111021111101221101 |
4 | 10021113211133113 |
5 | 33104222120421 |
6 | 2013440530531 |
7 | 215220415621 |
oct | 41127453727 |
9 | 12437441841 |
10 | 4452145111 |
11 | 1985135577 |
12 | a43020a47 |
13 | 55c4bc8bb |
14 | 30340dc11 |
15 | 1b0cd9191 |
hex | 1095e57d7 |
4452145111 has 2 divisors, whose sum is σ = 4452145112. Its totient is φ = 4452145110.
The previous prime is 4452145057. The next prime is 4452145141. The reversal of 4452145111 is 1115412544.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4452145111 - 223 = 4443756503 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4452145111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4452145141) 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, 2226072555 + 2226072556.
It is an arithmetic number, because the mean of its divisors is an integer number (2226072556).
Almost surely, 24452145111 is an apocalyptic number.
4452145111 is a deficient number, since it is larger than the sum of its proper divisors (1).
4452145111 is an equidigital number, since it uses as much as digits as its factorization.
4452145111 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3200, while the sum is 28.
The square root of 4452145111 is about 66724.3966701835. The cubic root of 4452145111 is about 1645.0904088299.
Adding to 4452145111 its reverse (1115412544), we get a palindrome (5567557655).
It can be divided in two parts, 445 and 2145111, that added together give a triangular number (2145556 = T2071).
The spelling of 4452145111 in words is "four billion, four hundred fifty-two million, one hundred forty-five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.081 sec. • engine limits •