Base | Representation |
---|---|
bin | 1001011101111110… |
… | …10110011100011001 |
3 | 111010021011201122222 |
4 | 10232333112130121 |
5 | 40402312414413 |
6 | 2200225153425 |
7 | 236653363046 |
oct | 45677263431 |
9 | 14107151588 |
10 | 5083326233 |
11 | 2179450267 |
12 | b9a48b875 |
13 | 6301b4c5b |
14 | 3631921cd |
15 | 1eb415b08 |
hex | 12efd6719 |
5083326233 has 4 divisors (see below), whose sum is σ = 5084732928. Its totient is φ = 5081919540.
The previous prime is 5083326221. The next prime is 5083326239. The reversal of 5083326233 is 3326233805.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5083326233 - 24 = 5083326217 is a prime.
It is a super-2 number, since 2×50833262332 = 51680411182211940578, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5083326193 and 5083326202.
It is not an unprimeable number, because it can be changed into a prime (5083326239) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 697913 + ... + 705158.
It is an arithmetic number, because the mean of its divisors is an integer number (1271183232).
Almost surely, 25083326233 is an apocalyptic number.
It is an amenable number.
5083326233 is a deficient number, since it is larger than the sum of its proper divisors (1406695).
5083326233 is a wasteful number, since it uses less digits than its factorization.
5083326233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1406694.
The product of its (nonzero) digits is 77760, while the sum is 35.
The square root of 5083326233 is about 71297.4489936351. The cubic root of 5083326233 is about 1719.4227187673.
The spelling of 5083326233 in words is "five billion, eighty-three million, three hundred twenty-six thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •