Base | Representation |
---|---|
bin | 100101010101110101010… |
… | …0100110010001000011001 |
3 | 200011121220201100212011222 |
4 | 1022223222210302020121 |
5 | 1133041043333244424 |
6 | 14525355533101425 |
7 | 1036532610106445 |
oct | 112535244621031 |
9 | 20147821325158 |
10 | 5132126462489 |
11 | 16a9582659404 |
12 | 6aa782927875 |
13 | 2b2c5a690710 |
14 | 13a579429825 |
15 | 8d7720c7e5e |
hex | 4aaea932219 |
5132126462489 has 8 divisors (see below), whose sum is σ = 5529224760192. Its totient is φ = 4735359498960.
The previous prime is 5132126462467. The next prime is 5132126462497. The reversal of 5132126462489 is 9842646212315.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5132126462489 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5132126462489.
It is not an unprimeable number, because it can be changed into a prime (5132126762489) 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, 82801367 + ... + 82863324.
It is an arithmetic number, because the mean of its divisors is an integer number (691153095024).
Almost surely, 25132126462489 is an apocalyptic number.
It is an amenable number.
5132126462489 is a deficient number, since it is larger than the sum of its proper divisors (397098297703).
5132126462489 is a wasteful number, since it uses less digits than its factorization.
5132126462489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165667087.
The product of its digits is 4976640, while the sum is 53.
The spelling of 5132126462489 in words is "five trillion, one hundred thirty-two billion, one hundred twenty-six million, four hundred sixty-two thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •