Base | Representation |
---|---|
bin | 10000110100100… |
… | …11101011001100 |
3 | 100211112100002200 |
4 | 20122103223030 |
5 | 242111122220 |
6 | 22000321500 |
7 | 3332310153 |
oct | 1032235314 |
9 | 324470080 |
10 | 141114060 |
11 | 7272309a |
12 | 3b313290 |
13 | 2330a459 |
14 | 14a5459a |
15 | c5c6890 |
hex | 8693acc |
141114060 has 72 divisors (see below), whose sum is σ = 434471856. Its totient is φ = 37065600.
The previous prime is 141114031. The next prime is 141114067. The reversal of 141114060 is 60411141.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (141114067) 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 23 ways as a sum of consecutive naturals, for example, 6210 + ... + 17910.
Almost surely, 2141114060 is an apocalyptic number.
141114060 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 141114060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (217235928).
141114060 is an abundant number, since it is smaller than the sum of its proper divisors (293357796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141114060 is a wasteful number, since it uses less digits than its factorization.
141114060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11783 (or 11778 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
The square root of 141114060 is about 11879.1439085483. The cubic root of 141114060 is about 520.6230942968.
The spelling of 141114060 in words is "one hundred forty-one million, one hundred fourteen thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •