Base | Representation |
---|---|
bin | 10000111011001… |
… | …00110001101000 |
3 | 100220010211222000 |
4 | 20131210301220 |
5 | 242321024121 |
6 | 22030531000 |
7 | 3342505161 |
oct | 1035446150 |
9 | 326124860 |
10 | 141970536 |
11 | 73158624 |
12 | 3b666a60 |
13 | 2354a246 |
14 | 14bd8768 |
15 | c6e5526 |
hex | 8764c68 |
141970536 has 192 divisors, whose sum is σ = 446601600. Its totient is φ = 41564160.
The previous prime is 141970531. The next prime is 141970537. The reversal of 141970536 is 635079141.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 141970536.
It is not an unprimeable number, because it can be changed into a prime (141970531) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3462676 + ... + 3462716.
It is an arithmetic number, because the mean of its divisors is an integer number (2326050).
Almost surely, 2141970536 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 141970536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (223300800).
141970536 is an abundant number, since it is smaller than the sum of its proper divisors (304631064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141970536 is a wasteful number, since it uses less digits than its factorization.
141970536 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 137 (or 86 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 36.
The square root of 141970536 is about 11915.1389416993. The cubic root of 141970536 is about 521.6742583908.
The spelling of 141970536 in words is "one hundred forty-one million, nine hundred seventy thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •