Base | Representation |
---|---|
bin | 101110010101110… |
… | …1110001010010110 |
3 | 11000100221102011120 |
4 | 1130223232022112 |
5 | 11141032341032 |
6 | 414144144410 |
7 | 53350662033 |
oct | 13453561226 |
9 | 4010842146 |
10 | 1554965142 |
11 | 728812365 |
12 | 374908106 |
13 | 1ba1c8623 |
14 | 10a73038a |
15 | 917a562c |
hex | 5caee296 |
1554965142 has 8 divisors (see below), whose sum is σ = 3109930296. Its totient is φ = 518321712.
The previous prime is 1554965141. The next prime is 1554965161. The reversal of 1554965142 is 2415694551.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
1554965142 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1554965094 and 1554965103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1554965141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 129580423 + ... + 129580434.
It is an arithmetic number, because the mean of its divisors is an integer number (388741287).
Almost surely, 21554965142 is an apocalyptic number.
1554965142 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.
1554965142 is a wasteful number, since it uses less digits than its factorization.
1554965142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259160862.
The product of its digits is 216000, while the sum is 42.
The square root of 1554965142 is about 39433.0463190457. The cubic root of 1554965142 is about 1158.5289373701.
The spelling of 1554965142 in words is "one billion, five hundred fifty-four million, nine hundred sixty-five thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •