Base | Representation |
---|---|
bin | 1001111010110101… |
… | …11100011011011101 |
3 | 111202010202102022200 |
4 | 10331122330123131 |
5 | 41401303100413 |
6 | 2240234402113 |
7 | 245653333164 |
oct | 47532743335 |
9 | 14663672280 |
10 | 5325440733 |
11 | 2293088498 |
12 | 1047590339 |
13 | 66b3c6382 |
14 | 3873b83db |
15 | 2127dd573 |
hex | 13d6bc6dd |
5325440733 has 18 divisors (see below), whose sum is σ = 7714794906. Its totient is φ = 3539943072.
The previous prime is 5325440719. The next prime is 5325440753. The reversal of 5325440733 is 3370445235.
5325440733 is a `hidden beast` number, since 532 + 54 + 4 + 0 + 73 + 3 = 666.
It can be written as a sum of positive squares in 3 ways, for example, as 224910009 + 5100530724 = 14997^2 + 71418^2 .
It is not a de Polignac number, because 5325440733 - 24 = 5325440717 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5325440753) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 1250035 + ... + 1254287.
It is an arithmetic number, because the mean of its divisors is an integer number (428599717).
Almost surely, 25325440733 is an apocalyptic number.
It is an amenable number.
5325440733 is a deficient number, since it is larger than the sum of its proper divisors (2389354173).
5325440733 is an equidigital number, since it uses as much as digits as its factorization.
5325440733 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5005 (or 4629 counting only the distinct ones).
The product of its (nonzero) digits is 151200, while the sum is 36.
The square root of 5325440733 is about 72975.6173869053. The cubic root of 5325440733 is about 1746.2986512982.
Adding to 5325440733 its reverse (3370445235), we get a palindrome (8695885968).
The spelling of 5325440733 in words is "five billion, three hundred twenty-five million, four hundred forty thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •