Base | Representation |
---|---|
bin | 10110011100101011011… |
… | …010011101000000110011 |
3 | 12110110202221201110201201 |
4 | 112130223122131000303 |
5 | 200233242113123011 |
6 | 3140400502512031 |
7 | 216310413241153 |
oct | 26345332350063 |
9 | 5413687643651 |
10 | 1542621614131 |
11 | 545249759984 |
12 | 20ab78a35617 |
13 | b2612668b20 |
14 | 549400a4763 |
15 | 2a1d90d0cc1 |
hex | 1672b69d033 |
1542621614131 has 4 divisors (see below), whose sum is σ = 1661284815232. Its totient is φ = 1423958413032.
The previous prime is 1542621614119. The next prime is 1542621614161. The reversal of 1542621614131 is 1314161262451.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1542621614131 - 27 = 1542621614003 is a prime.
It is a super-2 number, since 2×15426216141312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1542621614161) 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, 59331600531 + ... + 59331600556.
It is an arithmetic number, because the mean of its divisors is an integer number (415321203808).
Almost surely, 21542621614131 is an apocalyptic number.
1542621614131 is a deficient number, since it is larger than the sum of its proper divisors (118663201101).
1542621614131 is a wasteful number, since it uses less digits than its factorization.
1542621614131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118663201100.
The product of its digits is 34560, while the sum is 37.
Adding to 1542621614131 its reverse (1314161262451), we get a palindrome (2856782876582).
The spelling of 1542621614131 in words is "one trillion, five hundred forty-two billion, six hundred twenty-one million, six hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •