Base | Representation |
---|---|
bin | 1000010001000101001… |
… | …0111110111111011001 |
3 | 111120120220102022201202 |
4 | 2010101102332333121 |
5 | 4311331133010131 |
6 | 145124525323545 |
7 | 13155330005522 |
oct | 2042122767731 |
9 | 446526368652 |
10 | 142024110041 |
11 | 552609a8a60 |
12 | 236377065b5 |
13 | 1051502b448 |
14 | 6c343a1849 |
15 | 3a63797bcb |
hex | 21114befd9 |
142024110041 has 8 divisors (see below), whose sum is σ = 154939514304. Its totient is φ = 129109392720.
The previous prime is 142024110029. The next prime is 142024110043. The reversal of 142024110041 is 140011420241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 142024110041 - 26 = 142024109977 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 142024109995 and 142024110022.
It is not an unprimeable number, because it can be changed into a prime (142024110043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 322391 + ... + 622883.
It is an arithmetic number, because the mean of its divisors is an integer number (19367439288).
Almost surely, 2142024110041 is an apocalyptic number.
142024110041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
142024110041 is a deficient number, since it is larger than the sum of its proper divisors (12915404263).
142024110041 is a wasteful number, since it uses less digits than its factorization.
142024110041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 343471.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 142024110041 its reverse (140011420241), we get a palindrome (282035530282).
The spelling of 142024110041 in words is "one hundred forty-two billion, twenty-four million, one hundred ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •