Base | Representation |
---|---|
bin | 10000110100000… |
… | …11100011111100 |
3 | 100211101222120020 |
4 | 20122003203330 |
5 | 242102014220 |
6 | 21555052140 |
7 | 3331613556 |
oct | 1032034374 |
9 | 324358506 |
10 | 141048060 |
11 | 7268854a |
12 | 3b2a1050 |
13 | 232b63ba |
14 | 14a384d6 |
15 | c5b2040 |
hex | 86838fc |
141048060 has 48 divisors (see below), whose sum is σ = 396972576. Its totient is φ = 37418752.
The previous prime is 141048007. The next prime is 141048091. The reversal of 141048060 is 60840141.
141048060 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 141048060.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 5854 + ... + 17786.
It is an arithmetic number, because the mean of its divisors is an integer number (8270262).
Almost surely, 2141048060 is an apocalyptic number.
141048060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141048060 is an abundant number, since it is smaller than the sum of its proper divisors (255924516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141048060 is a wasteful number, since it uses less digits than its factorization.
141048060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12142 (or 12140 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 24.
The square root of 141048060 is about 11876.3656056893. The cubic root of 141048060 is about 520.5419153257.
The spelling of 141048060 in words is "one hundred forty-one million, forty-eight thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •