Base | Representation |
---|---|
bin | 1010011101000000… |
… | …11111000111100101 |
3 | 112111010011112102200 |
4 | 11032200133013211 |
5 | 42443144344323 |
6 | 2324514525113 |
7 | 256034054460 |
oct | 51640370745 |
9 | 15433145380 |
10 | 5612106213 |
11 | 241a98450a |
12 | 1107596799 |
13 | 6b590590c |
14 | 3b34ba2d7 |
15 | 22ca66443 |
hex | 14e81f1e5 |
5612106213 has 24 divisors (see below), whose sum is σ = 9275937216. Its totient is φ = 3202934400.
The previous prime is 5612106211. The next prime is 5612106229. The reversal of 5612106213 is 3126012165.
It is not a de Polignac number, because 5612106213 - 21 = 5612106211 is a prime.
It is a super-2 number, since 2×56121062132 = 62991472291986402738, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5612106211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3828 + ... + 106013.
It is an arithmetic number, because the mean of its divisors is an integer number (386497384).
Almost surely, 25612106213 is an apocalyptic number.
It is an amenable number.
5612106213 is a deficient number, since it is larger than the sum of its proper divisors (3663831003).
5612106213 is a wasteful number, since it uses less digits than its factorization.
5612106213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110665 (or 110662 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 5612106213 is about 74913.9921042792. The cubic root of 5612106213 is about 1777.0867437628.
Adding to 5612106213 its reverse (3126012165), we get a palindrome (8738118378).
The spelling of 5612106213 in words is "five billion, six hundred twelve million, one hundred six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •