Base | Representation |
---|---|
bin | 10000110100101… |
… | …00001001110100 |
3 | 100211112102210021 |
4 | 20122110021310 |
5 | 242111203040 |
6 | 22000334524 |
7 | 3332315653 |
oct | 1032241164 |
9 | 324472707 |
10 | 141116020 |
11 | 72724611 |
12 | 3b314444 |
13 | 2330b306 |
14 | 14a5519a |
15 | c5c724a |
hex | 8694274 |
141116020 has 24 divisors (see below), whose sum is σ = 296801568. Its totient is φ = 56359200.
The previous prime is 141116011. The next prime is 141116033. The reversal of 141116020 is 20611141.
It is a super-2 number, since 2×1411160202 = 39827462201280800, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 141115985 and 141116003.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 8715 + ... + 18925.
It is an arithmetic number, because the mean of its divisors is an integer number (12366732).
Almost surely, 2141116020 is an apocalyptic number.
141116020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141116020 is an abundant number, since it is smaller than the sum of its proper divisors (155685548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141116020 is a wasteful number, since it uses less digits than its factorization.
141116020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10911 (or 10909 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
The square root of 141116020 is about 11879.2264057892. The cubic root of 141116020 is about 520.6255046792.
Adding to 141116020 its reverse (20611141), we get a palindrome (161727161).
The spelling of 141116020 in words is "one hundred forty-one million, one hundred sixteen thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •