Base | Representation |
---|---|
bin | 10000111001000… |
… | …11101101101110 |
3 | 100212122022102000 |
4 | 20130203231232 |
5 | 242234012141 |
6 | 22021113130 |
7 | 3340315221 |
oct | 1034435556 |
9 | 325568360 |
10 | 141704046 |
11 | 72a96390 |
12 | 3b5587a6 |
13 | 23485b63 |
14 | 14b695b8 |
15 | c6915b6 |
hex | 8723b6e |
141704046 has 64 divisors (see below), whose sum is σ = 345600000. Its totient is φ = 42681600.
The previous prime is 141704039. The next prime is 141704047. The reversal of 141704046 is 640407141.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141704047) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 112830 + ... + 114078.
It is an arithmetic number, because the mean of its divisors is an integer number (5400000).
Almost surely, 2141704046 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 141704046, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (172800000).
141704046 is an abundant number, since it is smaller than the sum of its proper divisors (203895954).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141704046 is a wasteful number, since it uses less digits than its factorization.
141704046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1462 (or 1456 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 141704046 is about 11903.9508567534. The cubic root of 141704046 is about 521.3476459064.
It can be divided in two parts, 1417040 and 46, that added together give a triangular number (1417086 = T1683).
The spelling of 141704046 in words is "one hundred forty-one million, seven hundred four thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •