Base | Representation |
---|---|
bin | 1001101111110110… |
… | …01010111101000001 |
3 | 111111201020101212001 |
4 | 10313323022331001 |
5 | 41204201204122 |
6 | 2223142104001 |
7 | 243453453211 |
oct | 46773127501 |
9 | 14451211761 |
10 | 5233225537 |
11 | 2246023891 |
12 | 102071b001 |
13 | 65527a077 |
14 | 379052241 |
15 | 209675527 |
hex | 137ecaf41 |
5233225537 has 16 divisors (see below), whose sum is σ = 5882457600. Its totient is φ = 4632405120.
The previous prime is 5233225511. The next prime is 5233225553. The reversal of 5233225537 is 7355223325.
It is a cyclic number.
It is not a de Polignac number, because 5233225537 - 27 = 5233225409 is a prime.
It is a super-2 number, since 2×52332255372 = 54773299042217876738, 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 = 5233225496 and 5233225505.
It is not an unprimeable number, because it can be changed into a prime (5233225507) 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 15 ways as a sum of consecutive naturals, for example, 136108 + ... + 170269.
It is an arithmetic number, because the mean of its divisors is an integer number (367653600).
Almost surely, 25233225537 is an apocalyptic number.
It is an amenable number.
5233225537 is a deficient number, since it is larger than the sum of its proper divisors (649232063).
5233225537 is a wasteful number, since it uses less digits than its factorization.
5233225537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306456.
The product of its digits is 189000, while the sum is 37.
The square root of 5233225537 is about 72341.0363279377. The cubic root of 5233225537 is about 1736.1602846025.
The spelling of 5233225537 in words is "five billion, two hundred thirty-three million, two hundred twenty-five thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •