Base | Representation |
---|---|
bin | 1110100100000100111… |
… | …0011101111111000000 |
3 | 212220211000222121100121 |
4 | 3221001032131333000 |
5 | 13044403304240130 |
6 | 310535202030024 |
7 | 24035151303034 |
oct | 3510116357700 |
9 | 786730877317 |
10 | 250202415040 |
11 | 97123816706 |
12 | 405a8348314 |
13 | 1a794cb04c6 |
14 | c1776621c4 |
15 | 679599dd7a |
hex | 3a4139dfc0 |
250202415040 has 112 divisors (see below), whose sum is σ = 664043680800. Its totient is φ = 89236242432.
The previous prime is 250202415037. The next prime is 250202415143. The reversal of 250202415040 is 40514202052.
250202415040 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 250202414996 and 250202415014.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1106985 + ... + 1313704.
Almost surely, 2250202415040 is an apocalyptic number.
250202415040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
250202415040 is an abundant number, since it is smaller than the sum of its proper divisors (413841265760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
250202415040 is a wasteful number, since it uses less digits than its factorization.
250202415040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2420742 (or 2420732 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 25.
Adding to 250202415040 its reverse (40514202052), we get a palindrome (290716617092).
The spelling of 250202415040 in words is "two hundred fifty billion, two hundred two million, four hundred fifteen thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •