Base | Representation |
---|---|
bin | 100101000111000011111… |
… | …010001011001111100010 |
3 | 100000210111222202102201010 |
4 | 211013003322023033202 |
5 | 313240303304222200 |
6 | 5231314040121350 |
7 | 352150251600534 |
oct | 45070372131742 |
9 | 10023458672633 |
10 | 2550202414050 |
11 | 8a3597862a75 |
12 | 3522b5766256 |
13 | 156638372b95 |
14 | 8b605253854 |
15 | 4650b13a150 |
hex | 251c3e8b3e2 |
2550202414050 has 24 divisors (see below), whose sum is σ = 6324501987216. Its totient is φ = 680053977040.
The previous prime is 2550202414027. The next prime is 2550202414051. The reversal of 2550202414050 is 504142020552.
2550202414050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 2550202413999 and 2550202414017.
It is not an unprimeable number, because it can be changed into a prime (2550202414051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8500674564 + ... + 8500674863.
It is an arithmetic number, because the mean of its divisors is an integer number (263520916134).
Almost surely, 22550202414050 is an apocalyptic number.
2550202414050 is an abundant number, since it is smaller than the sum of its proper divisors (3774299573166).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2550202414050 is a wasteful number, since it uses less digits than its factorization.
2550202414050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17001349442 (or 17001349437 counting only the distinct ones).
The product of its (nonzero) digits is 16000, while the sum is 30.
The spelling of 2550202414050 in words is "two trillion, five hundred fifty billion, two hundred two million, four hundred fourteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •