Base | Representation |
---|---|
bin | 100101011100011001011… |
… | …0001000110100000101011 |
3 | 200012222022002122110100011 |
4 | 1022320302301012200223 |
5 | 1133303430433200011 |
6 | 14540050401152351 |
7 | 1040542122645562 |
oct | 112706261064053 |
9 | 20188262573304 |
10 | 5146222553131 |
11 | 17045565189a0 |
12 | 6b145762b6b7 |
13 | 2b4395b7485a |
14 | 13b115596bd9 |
15 | 8dce988c621 |
hex | 4ae32c4682b |
5146222553131 has 8 divisors (see below), whose sum is σ = 5614173640944. Its totient is φ = 4678290244320.
The previous prime is 5146222553099. The next prime is 5146222553179. The reversal of 5146222553131 is 1313552226415.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5146222553131 - 25 = 5146222553099 is a prime.
It is a super-2 number, since 2×51462225531312 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5146222557131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4118676 + ... + 5220721.
It is an arithmetic number, because the mean of its divisors is an integer number (701771705118).
Almost surely, 25146222553131 is an apocalyptic number.
5146222553131 is a deficient number, since it is larger than the sum of its proper divisors (467951087813).
5146222553131 is a wasteful number, since it uses less digits than its factorization.
5146222553131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9389501.
The product of its digits is 216000, while the sum is 40.
Adding to 5146222553131 its reverse (1313552226415), we get a palindrome (6459774779546).
The spelling of 5146222553131 in words is "five trillion, one hundred forty-six billion, two hundred twenty-two million, five hundred fifty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •