Base | Representation |
---|---|
bin | 1001001010001110100111… |
… | …01011110111110111011101 |
3 | 2122022121201010112002111120 |
4 | 10211013103223313313131 |
5 | 10120004123201111131 |
6 | 110501223534041153 |
7 | 4146154502524314 |
oct | 445072353676735 |
9 | 78277633462446 |
10 | 20142653144541 |
11 | 64664a6644a14 |
12 | 23139459491b9 |
13 | b315a0735435 |
14 | 4d8ca3da327b |
15 | 24de53984496 |
hex | 1251d3af7ddd |
20142653144541 has 8 divisors (see below), whose sum is σ = 26856901667904. Its totient is φ = 13428420025440.
The previous prime is 20142653144519. The next prime is 20142653144557. The reversal of 20142653144541 is 14544135624102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-20142653144541 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20142653144493 and 20142653144502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20142653142541) 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, 343641 + ... + 6356366.
It is an arithmetic number, because the mean of its divisors is an integer number (3357112708488).
Almost surely, 220142653144541 is an apocalyptic number.
It is an amenable number.
20142653144541 is a deficient number, since it is larger than the sum of its proper divisors (6714248523363).
20142653144541 is a wasteful number, since it uses less digits than its factorization.
20142653144541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7702131.
The product of its (nonzero) digits is 460800, while the sum is 42.
Adding to 20142653144541 its reverse (14544135624102), we get a palindrome (34686788768643).
The spelling of 20142653144541 in words is "twenty trillion, one hundred forty-two billion, six hundred fifty-three million, one hundred forty-four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •