Base | Representation |
---|---|
bin | 1110100111111100010… |
… | …0101100111010101000 |
3 | 220000111100110112011101 |
4 | 3221333010230322220 |
5 | 13104014422322102 |
6 | 311230150011144 |
7 | 24102651060001 |
oct | 3517704547250 |
9 | 800440415141 |
10 | 251240042152 |
11 | 976064aa280 |
12 | 40837946ab4 |
13 | 1a8cbc63148 |
14 | c2353a61a8 |
15 | 6806b13e87 |
hex | 3a7f12cea8 |
251240042152 has 64 divisors (see below), whose sum is σ = 516444465600. Its totient is φ = 113635200000.
The previous prime is 251240042113. The next prime is 251240042161.
It is a happy number.
251240042152 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×2512400421522 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 251240042152.
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, 56443527 + ... + 56447977.
It is an arithmetic number, because the mean of its divisors is an integer number (8069444775).
Almost surely, 2251240042152 is an apocalyptic number.
251240042152 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
251240042152 is an abundant number, since it is smaller than the sum of its proper divisors (265204423448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
251240042152 is a wasteful number, since it uses less digits than its factorization.
251240042152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7498 (or 7494 counting only the distinct ones).
The product of its (nonzero) digits is 6400, while the sum is 28.
It can be divided in two parts, 2512400 and 42152, that added together give a palindrome (2554552).
The spelling of 251240042152 in words is "two hundred fifty-one billion, two hundred forty million, forty-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •