Base | Representation |
---|---|
bin | 10000110100001100… |
… | …110011000000010000 |
3 | 1201121022212111110110 |
4 | 100310030303000100 |
5 | 243434220422211 |
6 | 12143351001320 |
7 | 1206302254050 |
oct | 206414630020 |
9 | 51538774413 |
10 | 18055639056 |
11 | 7725a34954 |
12 | 35ba969240 |
13 | 19199115c0 |
14 | c33d91560 |
15 | 70a1e8ea6 |
hex | 434333010 |
18055639056 has 80 divisors (see below), whose sum is σ = 57407686784. Its totient is φ = 4761925632.
The previous prime is 18055639027. The next prime is 18055639057. The reversal of 18055639056 is 65093655081.
It is a happy number.
It is a super-2 number, since 2×180556390562 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 18055638996 and 18055639014.
It is not an unprimeable number, because it can be changed into a prime (18055639057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2062441 + ... + 2071176.
Almost surely, 218055639056 is an apocalyptic number.
18055639056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
18055639056 is an abundant number, since it is smaller than the sum of its proper divisors (39352047728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18055639056 is a wasteful number, since it uses less digits than its factorization.
18055639056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4133648 (or 4133642 counting only the distinct ones).
The product of its (nonzero) digits is 972000, while the sum is 48.
The spelling of 18055639056 in words is "eighteen billion, fifty-five million, six hundred thirty-nine thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •