Base | Representation |
---|---|
bin | 1000000001000111… |
… | …0100001110111001 |
3 | 12112222122202022221 |
4 | 2000101310032321 |
5 | 13401422412131 |
6 | 553320044041 |
7 | 104222002402 |
oct | 20021641671 |
9 | 5488582287 |
10 | 2152154041 |
11 | a04920204 |
12 | 500903621 |
13 | 283b4b83b |
14 | 165b849a9 |
15 | c8e1a411 |
hex | 804743b9 |
2152154041 has 2 divisors, whose sum is σ = 2152154042. Its totient is φ = 2152154040.
The previous prime is 2152154021. The next prime is 2152154077. The reversal of 2152154041 is 1404512512.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2063794041 + 88360000 = 45429^2 + 9400^2 .
It is a cyclic number.
It is not a de Polignac number, because 2152154041 - 25 = 2152154009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2152153997 and 2152154015.
It is not a weakly prime, because it can be changed into another prime (2152154021) 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, 1076077020 + 1076077021.
It is an arithmetic number, because the mean of its divisors is an integer number (1076077021).
Almost surely, 22152154041 is an apocalyptic number.
It is an amenable number.
2152154041 is a deficient number, since it is larger than the sum of its proper divisors (1).
2152154041 is an equidigital number, since it uses as much as digits as its factorization.
2152154041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1600, while the sum is 25.
The square root of 2152154041 is about 46391.3142840338. The cubic root of 2152154041 is about 1291.0937663831.
Adding to 2152154041 its reverse (1404512512), we get a palindrome (3556666553).
The spelling of 2152154041 in words is "two billion, one hundred fifty-two million, one hundred fifty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •