Base | Representation |
---|---|
bin | 10000110011110… |
… | …00100000000000 |
3 | 100211022200102011 |
4 | 20121320200000 |
5 | 242044042002 |
6 | 21554102304 |
7 | 3331334512 |
oct | 1031704000 |
9 | 324280364 |
10 | 141002752 |
11 | 72657500 |
12 | 3b27a994 |
13 | 2329b8a7 |
14 | 14a25bb2 |
15 | c5a38d7 |
hex | 8678800 |
141002752 has 72 divisors (see below), whose sum is σ = 310441950. Its totient is φ = 63979520.
The previous prime is 141002747. The next prime is 141002753. The reversal of 141002752 is 257200141.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 134931456 + 6071296 = 11616^2 + 2464^2 .
It is a Harshad number since it is a multiple of its sum of digits (22).
It is not an unprimeable number, because it can be changed into a prime (141002753) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 247524 + ... + 248092.
Almost surely, 2141002752 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 141002752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (155220975).
141002752 is an abundant number, since it is smaller than the sum of its proper divisors (169439198).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141002752 is an equidigital number, since it uses as much as digits as its factorization.
141002752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 613 (or 582 counting only the distinct ones).
The product of its (nonzero) digits is 560, while the sum is 22.
The square root of 141002752 is about 11874.4579665768. The cubic root of 141002752 is about 520.4861725316.
Adding to 141002752 its reverse (257200141), we get a palindrome (398202893).
The spelling of 141002752 in words is "one hundred forty-one million, two thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •