Base | Representation |
---|---|
bin | 1000010001000010000… |
… | …1011010001001000101 |
3 | 111120112222222001120212 |
4 | 2010100201122021011 |
5 | 4311314321122203 |
6 | 145123343005205 |
7 | 13155111360404 |
oct | 2042041321105 |
9 | 446488861525 |
10 | 142011114053 |
11 | 55254631976 |
12 | 23633299805 |
13 | 1051242b003 |
14 | 6c3277b63b |
15 | 3a6257c1d8 |
hex | 211085a245 |
142011114053 has 4 divisors (see below), whose sum is σ = 142016853408. Its totient is φ = 142005374700.
The previous prime is 142011114017. The next prime is 142011114067. The reversal of 142011114053 is 350411110241.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 350411110241 = 43 ⋅8149095587.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142011114053 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142011114083) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2832401 + ... + 2882102.
It is an arithmetic number, because the mean of its divisors is an integer number (35504213352).
Almost surely, 2142011114053 is an apocalyptic number.
It is an amenable number.
142011114053 is a deficient number, since it is larger than the sum of its proper divisors (5739355).
142011114053 is an equidigital number, since it uses as much as digits as its factorization.
142011114053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5739354.
The product of its (nonzero) digits is 480, while the sum is 23.
Adding to 142011114053 its reverse (350411110241), we get a palindrome (492422224294).
The spelling of 142011114053 in words is "one hundred forty-two billion, eleven million, one hundred fourteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •