Base | Representation |
---|---|
bin | 10110011100011110011… |
… | …100100001000010111011 |
3 | 12110110012210100010101211 |
4 | 112130132130201002323 |
5 | 200232320414114011 |
6 | 3140323131423551 |
7 | 216302132054536 |
oct | 26343634410273 |
9 | 5413183303354 |
10 | 1542404051131 |
11 | 545147970649 |
12 | 20ab17bb4bb7 |
13 | b25a9572718 |
14 | 5491d22da1d |
15 | 2a1c4e57b21 |
hex | 1671e7210bb |
1542404051131 has 4 divisors (see below), whose sum is σ = 1542406684600. Its totient is φ = 1542401417664.
The previous prime is 1542404051117. The next prime is 1542404051143. The reversal of 1542404051131 is 1311504042451.
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 1542404051131 - 211 = 1542404049083 is a prime.
It is a super-2 number, since 2×15424040511312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1542404051093 and 1542404051102.
It is not an unprimeable number, because it can be changed into a prime (1542404051171) 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, 2155 + ... + 1756363.
It is an arithmetic number, because the mean of its divisors is an integer number (385601671150).
Almost surely, 21542404051131 is an apocalyptic number.
1542404051131 is a deficient number, since it is larger than the sum of its proper divisors (2633469).
1542404051131 is an equidigital number, since it uses as much as digits as its factorization.
1542404051131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2633468.
The product of its (nonzero) digits is 9600, while the sum is 31.
Adding to 1542404051131 its reverse (1311504042451), we get a palindrome (2853908093582).
The spelling of 1542404051131 in words is "one trillion, five hundred forty-two billion, four hundred four million, fifty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •