Base | Representation |
---|---|
bin | 1000000001001011… |
… | …0000011100011101 |
3 | 12120000010021122022 |
4 | 2000102300130131 |
5 | 13402003310134 |
6 | 553325225525 |
7 | 104224050416 |
oct | 20022603435 |
9 | 5500107568 |
10 | 2152400669 |
11 | a04a79531 |
12 | 500a022a5 |
13 | 283c06b83 |
14 | 165c0a80d |
15 | c8e6852e |
hex | 804b071d |
2152400669 has 2 divisors, whose sum is σ = 2152400670. Its totient is φ = 2152400668.
The previous prime is 2152400633. The next prime is 2152400671. The reversal of 2152400669 is 9660042512.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2062340569 + 90060100 = 45413^2 + 9490^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2152400669 is a prime.
It is a super-2 number, since 2×21524006692 = 9265657279823295122, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 2152400671, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2152400689) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1076200334 + 1076200335.
It is an arithmetic number, because the mean of its divisors is an integer number (1076200335).
Almost surely, 22152400669 is an apocalyptic number.
It is an amenable number.
2152400669 is a deficient number, since it is larger than the sum of its proper divisors (1).
2152400669 is an equidigital number, since it uses as much as digits as its factorization.
2152400669 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25920, while the sum is 35.
The square root of 2152400669 is about 46393.9723347764. The cubic root of 2152400669 is about 1291.1430825108.
The spelling of 2152400669 in words is "two billion, one hundred fifty-two million, four hundred thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •