Base | Representation |
---|---|
bin | 100000000101011100111011… |
… | …100101111001111011000000 |
3 | 200111122012010101020121210221 |
4 | 200011130323211321323000 |
5 | 121443440140434134100 |
6 | 1220042005451432424 |
7 | 41503005426626554 |
oct | 4005347345717300 |
9 | 614565111217727 |
10 | 141112150302400 |
11 | 40a65366072272 |
12 | 139b0591755714 |
13 | 6097a84826c04 |
14 | 26bbc16339864 |
15 | 114a9b69ec01a |
hex | 80573b979ec0 |
141112150302400 has 42 divisors (see below), whose sum is σ = 347224084841780. Its totient is φ = 56444860120320.
The previous prime is 141112150302359. The next prime is 141112150302467. The reversal of 141112150302400 is 4203051211141.
It is a happy number.
It is a super-2 number, since 2×1411121503024002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 44097545370 + ... + 44097548569.
Almost surely, 2141112150302400 is an apocalyptic number.
141112150302400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141112150302400 is an abundant number, since it is smaller than the sum of its proper divisors (206111934539380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141112150302400 is an equidigital number, since it uses as much as digits as its factorization.
141112150302400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88195093961 (or 88195093946 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 25.
The spelling of 141112150302400 in words is "one hundred forty-one trillion, one hundred twelve billion, one hundred fifty million, three hundred two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •