Base | Representation |
---|---|
bin | 11011100000010111… |
… | …10010011010001100 |
3 | 1102010010210100211121 |
4 | 31300023302122030 |
5 | 220220330241030 |
6 | 10441152530324 |
7 | 1031640525106 |
oct | 156013623214 |
9 | 42103710747 |
10 | 14767040140 |
11 | 6298677906 |
12 | 2a415509a4 |
13 | 15144c1798 |
14 | a01302576 |
15 | 5b664947a |
hex | 3702f268c |
14767040140 has 48 divisors (see below), whose sum is σ = 32957215200. Its totient is φ = 5538655232.
The previous prime is 14767040137. The next prime is 14767040173. The reversal of 14767040140 is 4104076741.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a junction number, because it is equal to n+sod(n) for n = 14767040096 and 14767040105.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10731 + ... + 172189.
It is an arithmetic number, because the mean of its divisors is an integer number (686608650).
Almost surely, 214767040140 is an apocalyptic number.
14767040140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14767040140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16478607600).
14767040140 is an abundant number, since it is smaller than the sum of its proper divisors (18190175060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14767040140 is a wasteful number, since it uses less digits than its factorization.
14767040140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 161754 (or 161752 counting only the distinct ones).
The product of its (nonzero) digits is 18816, while the sum is 34.
The spelling of 14767040140 in words is "fourteen billion, seven hundred sixty-seven million, forty thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •