Base | Representation |
---|---|
bin | 100000010010010111110110… |
… | …000001010011111110000101 |
3 | 200121210001221000211021011021 |
4 | 200102113312001103332011 |
5 | 122103012041033442013 |
6 | 1222001530213311141 |
7 | 41624110253655514 |
oct | 4022276601237605 |
9 | 617701830737137 |
10 | 142000041312133 |
11 | 41277974429494 |
12 | 13b146866354b1 |
13 | 61307146aa904 |
14 | 270cba545267b |
15 | 1163b30e29a8d |
hex | 8125f6053f85 |
142000041312133 has 12 divisors (see below), whose sum is σ = 142574741517600. Its totient is φ = 141427648517000.
The previous prime is 142000041312121. The next prime is 142000041312137. The reversal of 142000041312133 is 331213140000241.
It is not a de Polignac number, because 142000041312133 - 29 = 142000041311621 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 142000041312098 and 142000041312107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142000041312137) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1852128066 + ... + 1852204732.
It is an arithmetic number, because the mean of its divisors is an integer number (11881228459800).
Almost surely, 2142000041312133 is an apocalyptic number.
It is an amenable number.
142000041312133 is a deficient number, since it is larger than the sum of its proper divisors (574700205467).
142000041312133 is an frugal number, since it uses more digits than its factorization.
142000041312133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106568 (or 106317 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 142000041312133 its reverse (331213140000241), we get a palindrome (473213181312374).
The spelling of 142000041312133 in words is "one hundred forty-two trillion, forty-one million, three hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •