Base | Representation |
---|---|
bin | 11110010101011… |
… | …01100001011100 |
3 | 122201211012220212 |
4 | 33022231201130 |
5 | 1010120404030 |
6 | 41130031552 |
7 | 6206632535 |
oct | 1712554134 |
9 | 581735825 |
10 | 254466140 |
11 | 1207041a5 |
12 | 712785b8 |
13 | 409474a6 |
14 | 25b1d68c |
15 | 17517595 |
hex | f2ad85c |
254466140 has 12 divisors (see below), whose sum is σ = 534378936. Its totient is φ = 101786448.
The previous prime is 254466139. The next prime is 254466143. The reversal of 254466140 is 41664452.
It is a hoax number, since the sum of its digits (32) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 254466097 and 254466106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (254466143) 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, 6361634 + ... + 6361673.
It is an arithmetic number, because the mean of its divisors is an integer number (44531578).
Almost surely, 2254466140 is an apocalyptic number.
254466140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
254466140 is an abundant number, since it is smaller than the sum of its proper divisors (279912796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
254466140 is a wasteful number, since it uses less digits than its factorization.
254466140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12723316 (or 12723314 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 32.
The square root of 254466140 is about 15951.9948595779. The cubic root of 254466140 is about 633.6897280024.
The spelling of 254466140 in words is "two hundred fifty-four million, four hundred sixty-six thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •