Base | Representation |
---|---|
bin | 10000111000000… |
… | …11111101000000 |
3 | 100212101200221201 |
4 | 20130003331000 |
5 | 242220331302 |
6 | 22014230544 |
7 | 3336234022 |
oct | 1034037500 |
9 | 325350851 |
10 | 141573952 |
11 | 72a07673 |
12 | 3b4b5454 |
13 | 2343b890 |
14 | 14b34012 |
15 | c667c87 |
hex | 8703f40 |
141573952 has 56 divisors (see below), whose sum is σ = 304166016. Its totient is φ = 64992768.
The previous prime is 141573919. The next prime is 141573961. The reversal of 141573952 is 259375141.
141573952 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 an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 218493 + ... + 219139.
It is an arithmetic number, because the mean of its divisors is an integer number (5431536).
Almost surely, 2141573952 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 141573952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152083008).
141573952 is an abundant number, since it is smaller than the sum of its proper divisors (162592064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141573952 is a wasteful number, since it uses less digits than its factorization.
141573952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 935 (or 925 counting only the distinct ones).
The product of its digits is 37800, while the sum is 37.
The square root of 141573952 is about 11898.4852817491. The cubic root of 141573952 is about 521.1880527993.
The spelling of 141573952 in words is "one hundred forty-one million, five hundred seventy-three thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •