Base | Representation |
---|---|
bin | 111110101010000… |
… | …0001100011111110 |
3 | 12102112001001101000 |
4 | 1331110001203332 |
5 | 13301203320103 |
6 | 544341431130 |
7 | 103046054535 |
oct | 17524014376 |
9 | 5375031330 |
10 | 2102401278 |
11 | 98982921a |
12 | 4a810b4a6 |
13 | 27674bb33 |
14 | 15d31331c |
15 | c488daa3 |
hex | 7d5018fe |
2102401278 has 16 divisors (see below), whose sum is σ = 4672002960. Its totient is φ = 700800408.
The previous prime is 2102401277. The next prime is 2102401331. The reversal of 2102401278 is 8721042012.
It is a super-2 number, since 2×21024012782 = 8840182267472066568, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102401277) 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 in 7 ways as a sum of consecutive naturals, for example, 19466625 + ... + 19466732.
It is an arithmetic number, because the mean of its divisors is an integer number (292000185).
Almost surely, 22102401278 is an apocalyptic number.
2102401278 is an abundant number, since it is smaller than the sum of its proper divisors (2569601682).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2102401278 is a wasteful number, since it uses less digits than its factorization.
2102401278 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38933368 (or 38933362 counting only the distinct ones).
The product of its (nonzero) digits is 1792, while the sum is 27.
The square root of 2102401278 is about 45851.9495550625. The cubic root of 2102401278 is about 1281.0670785205.
The spelling of 2102401278 in words is "two billion, one hundred two million, four hundred one thousand, two hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •