Base | Representation |
---|---|
bin | 1000001101101110111… |
… | …0010011110000000100 |
3 | 111111021021011012200012 |
4 | 2003123232103300010 |
5 | 4303011034201200 |
6 | 144455421005352 |
7 | 13124134166642 |
oct | 2033356236004 |
9 | 444237135605 |
10 | 141125303300 |
11 | 5493a611173 |
12 | 234266b3858 |
13 | 10400a61c37 |
14 | 6b8ac76192 |
15 | 3a0e904a35 |
hex | 20dbb93c04 |
141125303300 has 72 divisors (see below), whose sum is σ = 309047511360. Its totient is φ = 55935331200.
The previous prime is 141125303251. The next prime is 141125303339. The reversal of 141125303300 is 3303521141.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4817297 + ... + 4846503.
Almost surely, 2141125303300 is an apocalyptic number.
141125303300 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 141125303300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154523755680).
141125303300 is an abundant number, since it is smaller than the sum of its proper divisors (167922208060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141125303300 is a wasteful number, since it uses less digits than its factorization.
141125303300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29661 (or 29654 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 141125303300 its reverse (3303521141), we get a palindrome (144428824441).
The spelling of 141125303300 in words is "one hundred forty-one billion, one hundred twenty-five million, three hundred three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •