Base | Representation |
---|---|
bin | 100000000100010010011000… |
… | …011110101001111001110000 |
3 | 200111100112111211120121012102 |
4 | 200010102120132221321300 |
5 | 121441132222200213430 |
6 | 1215541130532115532 |
7 | 41464143006105542 |
oct | 4004223036517160 |
9 | 614315454517172 |
10 | 141032104304240 |
11 | 40a3441a1a9086 |
12 | 13998b72465ba8 |
13 | 6090369008366 |
14 | 26b7dc1429692 |
15 | 114887e494345 |
hex | 8044987a9e70 |
141032104304240 has 80 divisors (see below), whose sum is σ = 334919565490176. Its totient is φ = 55210421760000.
The previous prime is 141032104304177. The next prime is 141032104304261. The reversal of 141032104304240 is 42403401230141.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39773936 + ... + 43174415.
Almost surely, 2141032104304240 is an apocalyptic number.
141032104304240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141032104304240 is an abundant number, since it is smaller than the sum of its proper divisors (193887461185936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141032104304240 is a wasteful number, since it uses less digits than its factorization.
141032104304240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82948818 (or 82948812 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 141032104304240 its reverse (42403401230141), we get a palindrome (183435505534381).
The spelling of 141032104304240 in words is "one hundred forty-one trillion, thirty-two billion, one hundred four million, three hundred four thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •