Base | Representation |
---|---|
bin | 10001011001010110… |
… | …100011100100001010 |
3 | 1210012202202012011101 |
4 | 101121112203210022 |
5 | 301223303014000 |
6 | 12325254452014 |
7 | 1230611330365 |
oct | 213126434412 |
9 | 53182665141 |
10 | 18678954250 |
11 | 7a15867880 |
12 | 375366400a |
13 | 19b8ab1568 |
14 | c92a870dc |
15 | 744cbee6a |
hex | 4595a390a |
18678954250 has 64 divisors (see below), whose sum is σ = 39076442496. Its totient is φ = 6626640000.
The previous prime is 18678954227. The next prime is 18678954253. The reversal of 18678954250 is 5245987681.
It is a happy number.
It is a Smith number, since the sum of its digits (55) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (55).
It is a junction number, because it is equal to n+sod(n) for n = 18678954191 and 18678954200.
It is not an unprimeable number, because it can be changed into a prime (18678954253) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 29917 + ... + 195583.
It is an arithmetic number, because the mean of its divisors is an integer number (610569414).
Almost surely, 218678954250 is an apocalyptic number.
18678954250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
18678954250 is an abundant number, since it is smaller than the sum of its proper divisors (20397488246).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18678954250 is a wasteful number, since it uses less digits than its factorization.
18678954250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165736 (or 165726 counting only the distinct ones).
The product of its (nonzero) digits is 4838400, while the sum is 55.
The spelling of 18678954250 in words is "eighteen billion, six hundred seventy-eight million, nine hundred fifty-four thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •