Base | Representation |
---|---|
bin | 111110101010000… |
… | …1001011001011011 |
3 | 12102112002200101122 |
4 | 1331110021121123 |
5 | 13301210331441 |
6 | 544342235455 |
7 | 103046250233 |
oct | 17524113133 |
9 | 5375080348 |
10 | 2102433371 |
11 | 989850345 |
12 | 4a8125b8b |
13 | 27676061c |
14 | 15d320cc3 |
15 | c489834b |
hex | 7d50965b |
2102433371 has 2 divisors, whose sum is σ = 2102433372. Its totient is φ = 2102433370.
The previous prime is 2102433323. The next prime is 2102433397. The reversal of 2102433371 is 1733342012.
It is an a-pointer prime, because the next prime (2102433397) can be obtained adding 2102433371 to its sum of digits (26).
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2102433371 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2102433371.
It is not a weakly prime, because it can be changed into another prime (2102439371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1051216685 + 1051216686.
It is an arithmetic number, because the mean of its divisors is an integer number (1051216686).
Almost surely, 22102433371 is an apocalyptic number.
2102433371 is a deficient number, since it is larger than the sum of its proper divisors (1).
2102433371 is an equidigital number, since it uses as much as digits as its factorization.
2102433371 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 26.
The square root of 2102433371 is about 45852.2995170362. The cubic root of 2102433371 is about 1281.0735969520.
Adding to 2102433371 its reverse (1733342012), we get a palindrome (3835775383).
The spelling of 2102433371 in words is "two billion, one hundred two million, four hundred thirty-three thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •