Base | Representation |
---|---|
bin | 1000001101101101110… |
… | …0000100110010001000 |
3 | 111111020221011100212212 |
4 | 2003123130010302020 |
5 | 4303003323222100 |
6 | 144455130324252 |
7 | 13124045441243 |
oct | 2033334046210 |
9 | 444227140785 |
10 | 141120523400 |
11 | 54937946a3a |
12 | 23424b89688 |
13 | 103cca7a3ac |
14 | 6b8a39025a |
15 | 3a0e2ad635 |
hex | 20db704c88 |
141120523400 has 96 divisors (see below), whose sum is σ = 338837870280. Its totient is φ = 54618624000.
The previous prime is 141120523393. The next prime is 141120523421. The reversal of 141120523400 is 4325021141.
It can be written as a sum of positive squares in 12 ways, for example, as 16142718916 + 124977804484 = 127054^2 + 353522^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1286720 + ... + 1392080.
Almost surely, 2141120523400 is an apocalyptic number.
141120523400 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 141120523400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (169418935140).
141120523400 is an abundant number, since it is smaller than the sum of its proper divisors (197717346880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141120523400 is a wasteful number, since it uses less digits than its factorization.
141120523400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105595 (or 105586 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 23.
Adding to 141120523400 its reverse (4325021141), we get a palindrome (145445544541).
The spelling of 141120523400 in words is "one hundred forty-one billion, one hundred twenty million, five hundred twenty-three thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •