Base | Representation |
---|---|
bin | 1000001111010100110… |
… | …1010111011001011100 |
3 | 111112101001201002220210 |
4 | 2003311031113121130 |
5 | 4304400014000400 |
6 | 145010053212420 |
7 | 13140545404650 |
oct | 2036515273134 |
9 | 445331632823 |
10 | 141552875100 |
11 | 550399a919a |
12 | 23525931110 |
13 | 1046b5081c0 |
14 | 6bcb976a60 |
15 | 3a37212950 |
hex | 20f535765c |
141552875100 has 288 divisors, whose sum is σ = 514803050496. Its totient is φ = 29230387200.
The previous prime is 141552875017. The next prime is 141552875111. The reversal of 141552875100 is 1578255141.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1227940 + ... + 1338260.
It is an arithmetic number, because the mean of its divisors is an integer number (1787510592).
Almost surely, 2141552875100 is an apocalyptic number.
141552875100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 141552875100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (257401525248).
141552875100 is an abundant number, since it is smaller than the sum of its proper divisors (373250175396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141552875100 is a wasteful number, since it uses less digits than its factorization.
141552875100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110405 (or 110398 counting only the distinct ones).
The product of its (nonzero) digits is 56000, while the sum is 39.
The spelling of 141552875100 in words is "one hundred forty-one billion, five hundred fifty-two million, eight hundred seventy-five thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •