Base | Representation |
---|---|
bin | 1000001101011101010… |
… | …1000001101101100110 |
3 | 111111002010102000102021 |
4 | 2003113111001231212 |
5 | 4302333200120300 |
6 | 144444224333354 |
7 | 13122250352110 |
oct | 2032725015546 |
9 | 444063360367 |
10 | 141051566950 |
11 | 54901a28a38 |
12 | 23405a7425a |
13 | 103bb6b5868 |
14 | 6b811603b0 |
15 | 3a081dbd1a |
hex | 20d7541b66 |
141051566950 has 24 divisors (see below), whose sum is σ = 299835331632. Its totient is φ = 48360537120.
The previous prime is 141051566947. The next prime is 141051566951. The reversal of 141051566950 is 59665150141.
It is a hoax number, since the sum of its digits (43) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 141051566897 and 141051566906.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141051566951) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 201501889 + ... + 201502588.
It is an arithmetic number, because the mean of its divisors is an integer number (12493138818).
Almost surely, 2141051566950 is an apocalyptic number.
141051566950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
141051566950 is an abundant number, since it is smaller than the sum of its proper divisors (158783764682).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141051566950 is a wasteful number, since it uses less digits than its factorization.
141051566950 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 403004496 (or 403004491 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 43.
The spelling of 141051566950 in words is "one hundred forty-one billion, fifty-one million, five hundred sixty-six thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •