Base | Representation |
---|---|
bin | 100101011010011110101… |
… | …0010110101001111000011 |
3 | 200012120200002020110002120 |
4 | 1022310331102311033003 |
5 | 1133222012133401011 |
6 | 14534130002415323 |
7 | 1040335064350533 |
oct | 112647522651703 |
9 | 20176602213076 |
10 | 5142104200131 |
11 | 1702832848378 |
12 | 6b06a8361543 |
13 | 2b3b8a884aa2 |
14 | 13ac446354c3 |
15 | 8db58039a06 |
hex | 4ad3d4b53c3 |
5142104200131 has 8 divisors (see below), whose sum is σ = 6856154894160. Its totient is φ = 3428061486432.
The previous prime is 5142104200111. The next prime is 5142104200139. The reversal of 5142104200131 is 1310024012415.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5142104200131 - 27 = 5142104200003 is a prime.
It is a super-2 number, since 2×51421042001312 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5142104200139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 281296 + ... + 3219213.
It is an arithmetic number, because the mean of its divisors is an integer number (857019361770).
Almost surely, 25142104200131 is an apocalyptic number.
5142104200131 is a deficient number, since it is larger than the sum of its proper divisors (1714050694029).
5142104200131 is a wasteful number, since it uses less digits than its factorization.
5142104200131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3990165.
The product of its (nonzero) digits is 960, while the sum is 24.
Adding to 5142104200131 its reverse (1310024012415), we get a palindrome (6452128212546).
The spelling of 5142104200131 in words is "five trillion, one hundred forty-two billion, one hundred four million, two hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •