Base | Representation |
---|---|
bin | 1110101000010100111… |
… | …1011010100110111000 |
3 | 220000202120011102220112 |
4 | 3222011033122212320 |
5 | 13104222414422130 |
6 | 311244323443452 |
7 | 24105345422213 |
oct | 3520517324670 |
9 | 800676142815 |
10 | 251343514040 |
11 | 97659952233 |
12 | 40866526588 |
13 | 1a917521008 |
14 | c24501c77a |
15 | 6810c52495 |
hex | 3a853da9b8 |
251343514040 has 64 divisors (see below), whose sum is σ = 575732124000. Its totient is φ = 98726133760.
The previous prime is 251343514007. The next prime is 251343514063. The reversal of 251343514040 is 40415343152.
It is a junction number, because it is equal to n+sod(n) for n = 251343513988 and 251343514006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2135120 + ... + 2249760.
Almost surely, 2251343514040 is an apocalyptic number.
251343514040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 251343514040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (287866062000).
251343514040 is an abundant number, since it is smaller than the sum of its proper divisors (324388609960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
251343514040 is a wasteful number, since it uses less digits than its factorization.
251343514040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115640 (or 115636 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 251343514040 its reverse (40415343152), we get a palindrome (291758857192).
The spelling of 251343514040 in words is "two hundred fifty-one billion, three hundred forty-three million, five hundred fourteen thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •