Base | Representation |
---|---|
bin | 100110011011… |
… | …1000111000110 |
3 | 1101220122210100 |
4 | 1030313013012 |
5 | 20124224203 |
6 | 1555504530 |
7 | 333155334 |
oct | 114670706 |
9 | 41818710 |
10 | 20148678 |
11 | 10412000 |
12 | 68b8146 |
13 | 4235cc4 |
14 | 2966b54 |
15 | 1b7eea3 |
hex | 13371c6 |
20148678 has 72 divisors (see below), whose sum is σ = 49730616. Its totient is φ = 5895120.
The previous prime is 20148647. The next prime is 20148679. The reversal of 20148678 is 87684102.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20148679) 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 35 ways as a sum of consecutive naturals, for example, 694768 + ... + 694796.
It is an arithmetic number, because the mean of its divisors is an integer number (690703).
Almost surely, 220148678 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20148678, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24865308).
20148678 is an abundant number, since it is smaller than the sum of its proper divisors (29581938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20148678 is a wasteful number, since it uses less digits than its factorization.
20148678 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99 (or 45 counting only the distinct ones).
The product of its (nonzero) digits is 21504, while the sum is 36.
The square root of 20148678 is about 4488.7278821510. The cubic root of 20148678 is about 272.1127254075.
The spelling of 20148678 in words is "twenty million, one hundred forty-eight thousand, six hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •