Base | Representation |
---|---|
bin | 1001011111111110… |
… | …1010010100000100 |
3 | 20120201100212020101 |
4 | 2113333222110010 |
5 | 20210303014004 |
6 | 1101012213444 |
7 | 120123023200 |
oct | 22777522404 |
9 | 6521325211 |
10 | 2550048004 |
11 | 1099487899 |
12 | 5b200a284 |
13 | 31840365a |
14 | 1a295bb00 |
15 | edd14ba4 |
hex | 97fea504 |
2550048004 has 27 divisors (see below), whose sum is σ = 5192608743. Its totient is φ = 1092574728.
The previous prime is 2550048001. The next prime is 2550048037. The reversal of 2550048004 is 4008400552.
The square root of 2550048004 is 50498.
It is a perfect power (a square), and thus also a powerful number.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is not an unprimeable number, because it can be changed into a prime (2550048001) 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 8 ways as a sum of consecutive naturals, for example, 705169 + ... + 708775.
Almost surely, 22550048004 is an apocalyptic number.
2550048004 is the 50498-th square number.
It is an amenable number.
2550048004 is an abundant number, since it is smaller than the sum of its proper divisors (2642560739).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2550048004 is an frugal number, since it uses more digits than its factorization.
2550048004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7232 (or 3616 counting only the distinct ones).
The product of its (nonzero) digits is 6400, while the sum is 28.
The cubic root of 2550048004 is about 1366.2057809256.
Multiplying 2550048004 by its product of nonzero digits (6400), we get a square (16320307225600 = 40398402).
Adding to 2550048004 its reverse (4008400552), we get a palindrome (6558448556).
The spelling of 2550048004 in words is "two billion, five hundred fifty million, forty-eight thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •