Base | Representation |
---|---|
bin | 111110110110000… |
… | …100100000100100 |
3 | 2201110222010020222 |
4 | 332312010200210 |
5 | 4124404033021 |
6 | 252342343512 |
7 | 35061632426 |
oct | 7666044044 |
9 | 2643863228 |
10 | 1054361636 |
11 | 4a1183559 |
12 | 25512ab98 |
13 | 13a591933 |
14 | a005c816 |
15 | 6286d6ab |
hex | 3ed84824 |
1054361636 has 12 divisors (see below), whose sum is σ = 1847413680. Its totient is φ = 526529160.
The previous prime is 1054361621. The next prime is 1054361639. The reversal of 1054361636 is 6361634501.
It is a super-3 number, since 3×10543616363 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is an alternating number because its digits alternate between odd and even.
It is a junction number, because it is equal to n+sod(n) for n = 1054361596 and 1054361605.
It is not an unprimeable number, because it can be changed into a prime (1054361639) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 159266 + ... + 165753.
It is an arithmetic number, because the mean of its divisors is an integer number (153951140).
Almost surely, 21054361636 is an apocalyptic number.
It is an amenable number.
1054361636 is a deficient number, since it is larger than the sum of its proper divisors (793052044).
1054361636 is a wasteful number, since it uses less digits than its factorization.
1054361636 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325834 (or 325832 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 35.
The square root of 1054361636 is about 32470.9352498508. The cubic root of 1054361636 is about 1017.8017621230.
The spelling of 1054361636 in words is "one billion, fifty-four million, three hundred sixty-one thousand, six hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •