Base | Representation |
---|---|
bin | 100101111011001100011… |
… | …1111010001011001110001 |
3 | 200110022000110210011221001 |
4 | 1023312120333101121301 |
5 | 1140344404141200413 |
6 | 15030305344202001 |
7 | 1045403122300516 |
oct | 113663077213161 |
9 | 20408013704831 |
10 | 5212362053233 |
11 | 172a606547285 |
12 | 702235609301 |
13 | 2ba6a656142a |
14 | 1403cb5ad30d |
15 | 908bb0d14dd |
hex | 4bd98fd1671 |
5212362053233 has 8 divisors (see below), whose sum is σ = 5505422832000. Its totient is φ = 4921173867888.
The previous prime is 5212362053221. The next prime is 5212362053329. The reversal of 5212362053233 is 3323502632125.
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 5212362053233 - 213 = 5212362045041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5212362053192 and 5212362053201.
It is not an unprimeable number, because it can be changed into a prime (5212362053933) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 468142633 + ... + 468153766.
It is an arithmetic number, because the mean of its divisors is an integer number (688177854000).
Almost surely, 25212362053233 is an apocalyptic number.
It is an amenable number.
5212362053233 is a deficient number, since it is larger than the sum of its proper divisors (293060778767).
5212362053233 is a wasteful number, since it uses less digits than its factorization.
5212362053233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 936296711.
The product of its (nonzero) digits is 194400, while the sum is 37.
Adding to 5212362053233 its reverse (3323502632125), we get a palindrome (8535864685358).
The spelling of 5212362053233 in words is "five trillion, two hundred twelve billion, three hundred sixty-two million, fifty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •