Base | Representation |
---|---|
bin | 111110101101100… |
… | …0101100010001011 |
3 | 12102122112002211211 |
4 | 1331123011202023 |
5 | 13302142040210 |
6 | 544445233551 |
7 | 103100565046 |
oct | 17533054213 |
9 | 5378462754 |
10 | 2104252555 |
11 | 98a8830a9 |
12 | 4a88628b7 |
13 | 276c49672 |
14 | 15d675c5d |
15 | c4b0738a |
hex | 7d6c588b |
2104252555 has 4 divisors (see below), whose sum is σ = 2525103072. Its totient is φ = 1683402040.
The previous prime is 2104252547. The next prime is 2104252583. The reversal of 2104252555 is 5552524012.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 2104252555 - 23 = 2104252547 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 210425251 + ... + 210425260.
It is an arithmetic number, because the mean of its divisors is an integer number (631275768).
Almost surely, 22104252555 is an apocalyptic number.
2104252555 is a deficient number, since it is larger than the sum of its proper divisors (420850517).
2104252555 is an equidigital number, since it uses as much as digits as its factorization.
2104252555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 420850516.
The product of its (nonzero) digits is 20000, while the sum is 31.
The square root of 2104252555 is about 45872.1326624346. The cubic root of 2104252555 is about 1281.4429842801.
Adding to 2104252555 its reverse (5552524012), we get a palindrome (7656776567).
The spelling of 2104252555 in words is "two billion, one hundred four million, two hundred fifty-two thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •