Base | Representation |
---|---|
bin | 10000111001111… |
… | …01010001100100 |
3 | 100212211122000120 |
4 | 20130331101210 |
5 | 242300334430 |
6 | 22023241540 |
7 | 3341232363 |
oct | 1034752144 |
9 | 325748016 |
10 | 141808740 |
11 | 73058007 |
12 | 3b5a92b0 |
13 | 234c16c8 |
14 | 14b957da |
15 | c6b2610 |
hex | 873d464 |
141808740 has 48 divisors (see below), whose sum is σ = 397682880. Its totient is φ = 37756800.
The previous prime is 141808717. The next prime is 141808741. The reversal of 141808740 is 47808141.
141808740 is digitally balanced in base 3 and base 9, because in such bases it contains all the possibile digits an equal number of times.
141808740 is strictly pandigital in base 9.
It is not an unprimeable number, because it can be changed into a prime (141808741) 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 15 ways as a sum of consecutive naturals, for example, 48315 + ... + 51165.
It is an arithmetic number, because the mean of its divisors is an integer number (8285060).
Almost surely, 2141808740 is an apocalyptic number.
141808740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141808740 is an abundant number, since it is smaller than the sum of its proper divisors (255874140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141808740 is a wasteful number, since it uses less digits than its factorization.
141808740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3692 (or 3690 counting only the distinct ones).
The product of its (nonzero) digits is 7168, while the sum is 33.
The square root of 141808740 is about 11908.3474924105. The cubic root of 141808740 is about 521.4760085876.
The spelling of 141808740 in words is "one hundred forty-one million, eight hundred eight thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •