Base | Representation |
---|---|
bin | 1110100101010101111… |
… | …0010101110001110100 |
3 | 212221200201012102000201 |
4 | 3221111132111301310 |
5 | 13101102240320202 |
6 | 311033015050244 |
7 | 24046444611460 |
oct | 3512536256164 |
9 | 787621172021 |
10 | 250542120052 |
11 | 9728854a054 |
12 | 40682070984 |
13 | 1a81a4a07a3 |
14 | c1aa80d4a0 |
15 | 67b5702387 |
hex | 3a55795c74 |
250542120052 has 12 divisors (see below), whose sum is σ = 501084240160. Its totient is φ = 107375194296.
The previous prime is 250542120029. The next prime is 250542120053. The reversal of 250542120052 is 250021245052.
250542120052 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (28), and also a Moran number because the ratio is a prime number: 8947932859 = 250542120052 / (2 + 5 + 0 + 5 + 4 + 2 + 1 + 2 + 0 + 0 + 5 + 2).
It is a self number, because there is not a number n which added to its sum of digits gives 250542120052.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (250542120053) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4473966402 + ... + 4473966457.
Almost surely, 2250542120052 is an apocalyptic number.
It is an amenable number.
250542120052 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
250542120052 is a wasteful number, since it uses less digits than its factorization.
250542120052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8947932870 (or 8947932868 counting only the distinct ones).
The product of its (nonzero) digits is 8000, while the sum is 28.
The spelling of 250542120052 in words is "two hundred fifty billion, five hundred forty-two million, one hundred twenty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •