Base | Representation |
---|---|
bin | 101110010100010… |
… | …0010011001101000 |
3 | 11000022101000022020 |
4 | 1130220202121220 |
5 | 11140324134121 |
6 | 414114224440 |
7 | 53340614550 |
oct | 13450423150 |
9 | 4008330266 |
10 | 1554130536 |
11 | 7282a2302 |
12 | 374585120 |
13 | 1b9c9578a |
14 | 10a594160 |
15 | 9168d1c6 |
hex | 5ca22668 |
1554130536 has 128 divisors (see below), whose sum is σ = 4800768000. Its totient is φ = 409266432.
The previous prime is 1554130511. The next prime is 1554130559. The reversal of 1554130536 is 6350314551.
It is a junction number, because it is equal to n+sod(n) for n = 1554130497 and 1554130506.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 111525 + ... + 124683.
It is an arithmetic number, because the mean of its divisors is an integer number (37506000).
Almost surely, 21554130536 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1554130536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2400384000).
1554130536 is an abundant number, since it is smaller than the sum of its proper divisors (3246637464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1554130536 is a wasteful number, since it uses less digits than its factorization.
1554130536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13231 (or 13227 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 33.
The square root of 1554130536 is about 39422.4623279673. The cubic root of 1554130536 is about 1158.3216254888.
The spelling of 1554130536 in words is "one billion, five hundred fifty-four million, one hundred thirty thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •