Base | Representation |
---|---|
bin | 100101010000110000101… |
… | …0011100011010011011001 |
3 | 200010120210120101122212111 |
4 | 1022201201103203103121 |
5 | 1132401241241011441 |
6 | 14520355011512321 |
7 | 1035665640532120 |
oct | 112414123432331 |
9 | 20116716348774 |
10 | 5121233532121 |
11 | 16a49a2900613 |
12 | 6a86428b86a1 |
13 | 2b1c129b36a5 |
14 | 139c2486aab7 |
15 | 8d335b38081 |
hex | 4a8614e34d9 |
5121233532121 has 8 divisors (see below), whose sum is σ = 5862809090880. Its totient is φ = 4382150665488.
The previous prime is 5121233532097. The next prime is 5121233532131. The reversal of 5121233532121 is 1212353321215.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5121233532121 - 229 = 5120696661209 is a prime.
It is not an unprimeable number, because it can be changed into a prime (5121233532131) 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, 623168626 + ... + 623176843.
It is an arithmetic number, because the mean of its divisors is an integer number (732851136360).
Almost surely, 25121233532121 is an apocalyptic number.
It is an amenable number.
5121233532121 is a deficient number, since it is larger than the sum of its proper divisors (741575558759).
5121233532121 is a wasteful number, since it uses less digits than its factorization.
5121233532121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1246346063.
The product of its digits is 10800, while the sum is 31.
Adding to 5121233532121 its reverse (1212353321215), we get a palindrome (6333586853336).
The spelling of 5121233532121 in words is "five trillion, one hundred twenty-one billion, two hundred thirty-three million, five hundred thirty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •