Base | Representation |
---|---|
bin | 10000110101110… |
… | …01110001010100 |
3 | 100211211021010221 |
4 | 20122321301110 |
5 | 242131120400 |
6 | 22003524124 |
7 | 3333530116 |
oct | 1032716124 |
9 | 324737127 |
10 | 141270100 |
11 | 7281a354 |
12 | 3b389644 |
13 | 2336349a |
14 | 14a953b6 |
15 | c607c1a |
hex | 86b9c54 |
141270100 has 72 divisors (see below), whose sum is σ = 319424000. Its totient is φ = 54172800.
The previous prime is 141270089. The next prime is 141270127. The reversal of 141270100 is 1072141.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 616786 + ... + 617014.
Almost surely, 2141270100 is an apocalyptic number.
141270100 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 141270100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159712000).
141270100 is an abundant number, since it is smaller than the sum of its proper divisors (178153900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141270100 is a wasteful number, since it uses less digits than its factorization.
141270100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 473 (or 466 counting only the distinct ones).
The product of its (nonzero) digits is 56, while the sum is 16.
The square root of 141270100 is about 11885.7099072794. The cubic root of 141270100 is about 520.8149204513.
The spelling of 141270100 in words is "one hundred forty-one million, two hundred seventy thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •