Base | Representation |
---|---|
bin | 10000110011111… |
… | …10000101000000 |
3 | 100211100211202101 |
4 | 20121332011000 |
5 | 242100304400 |
6 | 21554400144 |
7 | 3331461232 |
oct | 1031760500 |
9 | 324324671 |
10 | 141025600 |
11 | 72672691 |
12 | 3b290054 |
13 | 232a9101 |
14 | 14a30252 |
15 | c5aa56a |
hex | 867e140 |
141025600 has 84 divisors (see below), whose sum is σ = 365353600. Its totient is φ = 53429760.
The previous prime is 141025583. The next prime is 141025631. The reversal of 141025600 is 6520141.
It is a Harshad number since it is a multiple of its sum of digits (19).
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 11 ways as a sum of consecutive naturals, for example, 28081 + ... + 32719.
Almost surely, 2141025600 is an apocalyptic number.
141025600 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 141025600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (182676800).
141025600 is an abundant number, since it is smaller than the sum of its proper divisors (224328000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141025600 is a wasteful number, since it uses less digits than its factorization.
141025600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4680 (or 4665 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 141025600 is about 11875.4199925729. The cubic root of 141025600 is about 520.5142841007.
Adding to 141025600 its reverse (6520141), we get a palindrome (147545741).
The spelling of 141025600 in words is "one hundred forty-one million, twenty-five thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •