Base | Representation |
---|---|
bin | 1001100001100000… |
… | …01100010111100001 |
3 | 111012022211121011120 |
4 | 10300300030113201 |
5 | 40432401012413 |
6 | 2203203202453 |
7 | 240462665040 |
oct | 46060142741 |
9 | 14168747146 |
10 | 5112907233 |
11 | 2194114975 |
12 | ba8376429 |
13 | 6363712c5 |
14 | 367092557 |
15 | 1edd0a723 |
hex | 130c0c5e1 |
5112907233 has 32 divisors (see below), whose sum is σ = 8253757440. Its totient is φ = 2748345600.
The previous prime is 5112907229. The next prime is 5112907243. The reversal of 5112907233 is 3327092115.
It is not a de Polignac number, because 5112907233 - 22 = 5112907229 is a prime.
It is a super-2 number, since 2×51129072332 = 52283640746527432578, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5112907194 and 5112907203.
It is not an unprimeable number, because it can be changed into a prime (5112907213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1325758 + ... + 1329608.
It is an arithmetic number, because the mean of its divisors is an integer number (257929920).
Almost surely, 25112907233 is an apocalyptic number.
It is an amenable number.
5112907233 is a deficient number, since it is larger than the sum of its proper divisors (3140850207).
5112907233 is a wasteful number, since it uses less digits than its factorization.
5112907233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7597.
The product of its (nonzero) digits is 11340, while the sum is 33.
The square root of 5112907233 is about 71504.5958872575. The cubic root of 5112907233 is about 1722.7515038510.
Adding to 5112907233 its reverse (3327092115), we get a palindrome (8439999348).
The spelling of 5112907233 in words is "five billion, one hundred twelve million, nine hundred seven thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •