Base | Representation |
---|---|
bin | 1001101110011100… |
… | …00011011000100010 |
3 | 111110212222111120222 |
4 | 10313032003120202 |
5 | 41143134214200 |
6 | 2222040403042 |
7 | 243251102561 |
oct | 46716033042 |
9 | 14425874528 |
10 | 5221398050 |
11 | 223a385700 |
12 | 1018776482 |
13 | 65299875b |
14 | 377653bd8 |
15 | 2085dad85 |
hex | 137383622 |
5221398050 has 54 divisors (see below), whose sum is σ = 10686457299. Its totient is φ = 1896646400.
The previous prime is 5221398047. The next prime is 5221398059. The reversal of 5221398050 is 508931225.
It can be written as a sum of positive squares in 5 ways, for example, as 34969 + 5221363081 = 187^2 + 72259^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=51095.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5221398050.
It is not an unprimeable number, because it can be changed into a prime (5221398059) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 5619986 + ... + 5620914.
Almost surely, 25221398050 is an apocalyptic number.
5221398050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5221398050 is an abundant number, since it is smaller than the sum of its proper divisors (5465059249).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5221398050 is an equidigital number, since it uses as much as digits as its factorization.
5221398050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1892 (or 947 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 35.
The square root of 5221398050 is about 72259.2419694533. The cubic root of 5221398050 is about 1734.8513466584.
The spelling of 5221398050 in words is "five billion, two hundred twenty-one million, three hundred ninety-eight thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •