Base | Representation |
---|---|
bin | 100101000111101101100… |
… | …100101000001001110111 |
3 | 100000212022201001000122211 |
4 | 211013231210220021313 |
5 | 313243221230032000 |
6 | 5231511250034251 |
7 | 352203500133055 |
oct | 45075544501167 |
9 | 10025281030584 |
10 | 2550901408375 |
11 | 8a3916385831 |
12 | 35246b878987 |
13 | 15671a11c5a8 |
14 | 8b6700091d5 |
15 | 4654c6ae7ba |
hex | 251ed928277 |
2550901408375 has 32 divisors (see below), whose sum is σ = 3236814884160. Its totient is φ = 2006583696000.
The previous prime is 2550901408351. The next prime is 2550901408387. The reversal of 2550901408375 is 5738041090552.
2550901408375 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2550901408375 - 27 = 2550901408247 is a prime.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 22964469 + ... + 23075281.
It is an arithmetic number, because the mean of its divisors is an integer number (101150465130).
Almost surely, 22550901408375 is an apocalyptic number.
2550901408375 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
2550901408375 is a deficient number, since it is larger than the sum of its proper divisors (685913475785).
2550901408375 is a wasteful number, since it uses less digits than its factorization.
2550901408375 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113908 (or 113898 counting only the distinct ones).
The product of its (nonzero) digits is 1512000, while the sum is 49.
The spelling of 2550901408375 in words is "two trillion, five hundred fifty billion, nine hundred one million, four hundred eight thousand, three hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •