Base | Representation |
---|---|
bin | 10000110111111… |
… | …10011011010000 |
3 | 100212100112220012 |
4 | 20123332123100 |
5 | 242214120222 |
6 | 22013534052 |
7 | 3336111020 |
oct | 1033763320 |
9 | 325315805 |
10 | 141551312 |
11 | 729a1661 |
12 | 3b4a4328 |
13 | 23431496 |
14 | 14b29a80 |
15 | c6611e2 |
hex | 86fe6d0 |
141551312 has 40 divisors (see below), whose sum is σ = 314860800. Its totient is φ = 60388992.
The previous prime is 141551309. The next prime is 141551317. The reversal of 141551312 is 213155141.
141551312 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141551317) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22889 + ... + 28407.
It is an arithmetic number, because the mean of its divisors is an integer number (7871520).
Almost surely, 2141551312 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 141551312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157430400).
141551312 is an abundant number, since it is smaller than the sum of its proper divisors (173309488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141551312 is a wasteful number, since it uses less digits than its factorization.
141551312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5763 (or 5757 counting only the distinct ones).
The product of its digits is 600, while the sum is 23.
The square root of 141551312 is about 11897.5338621077. The cubic root of 141551312 is about 521.1602691418.
The spelling of 141551312 in words is "one hundred forty-one million, five hundred fifty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •