Base | Representation |
---|---|
bin | 10001010101100000… |
… | …001001011110001110 |
3 | 1210001021012110102220 |
4 | 101111200021132032 |
5 | 301110234004300 |
6 | 12315030200210 |
7 | 1226165306664 |
oct | 212540113616 |
9 | 53037173386 |
10 | 18614359950 |
11 | 799235915a |
12 | 3735ab3066 |
13 | 19a85b6394 |
14 | c88270c34 |
15 | 73e2b0da0 |
hex | 45580978e |
18614359950 has 72 divisors (see below), whose sum is σ = 49038969192. Its totient is φ = 4671828480.
The previous prime is 18614359921. The next prime is 18614359961. The reversal of 18614359950 is 5995341681.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 18614359893 and 18614359902.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 171349 + ... + 258048.
Almost surely, 218614359950 is an apocalyptic number.
18614359950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
18614359950 is an abundant number, since it is smaller than the sum of its proper divisors (30424609242).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18614359950 is a wasteful number, since it uses less digits than its factorization.
18614359950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 429446 (or 429424 counting only the distinct ones).
The product of its (nonzero) digits is 1166400, while the sum is 51.
The spelling of 18614359950 in words is "eighteen billion, six hundred fourteen million, three hundred fifty-nine thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •