Base | Representation |
---|---|
bin | 1001111010010110… |
… | …01110111111000001 |
3 | 111201212000012002001 |
4 | 10331023032333001 |
5 | 41344224304213 |
6 | 2240010224001 |
7 | 245603331400 |
oct | 47513167701 |
9 | 14655005061 |
10 | 5321322433 |
11 | 2290825339 |
12 | 1046125001 |
13 | 66a5b39cb |
14 | 386a25637 |
15 | 2122781dd |
hex | 13d2cefc1 |
5321322433 has 24 divisors (see below), whose sum is σ = 6436405800. Its totient is φ = 4381267968.
The previous prime is 5321322401. The next prime is 5321322443. The reversal of 5321322433 is 3342231235.
It can be written as a sum of positive squares in 4 ways, for example, as 3339915264 + 1981407169 = 57792^2 + 44513^2 .
It is not a de Polignac number, because 5321322433 - 25 = 5321322401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5321322443) 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 23 ways as a sum of consecutive naturals, for example, 270433 + ... + 289441.
It is an arithmetic number, because the mean of its divisors is an integer number (268183575).
Almost surely, 25321322433 is an apocalyptic number.
It is an amenable number.
5321322433 is a deficient number, since it is larger than the sum of its proper divisors (1115083367).
5321322433 is a wasteful number, since it uses less digits than its factorization.
5321322433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19249 (or 19242 counting only the distinct ones).
The product of its digits is 12960, while the sum is 28.
The square root of 5321322433 is about 72947.3949706225. The cubic root of 5321322433 is about 1745.8483826878.
Adding to 5321322433 its reverse (3342231235), we get a palindrome (8663553668).
The spelling of 5321322433 in words is "five billion, three hundred twenty-one million, three hundred twenty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •