Base | Representation |
---|---|
bin | 1001111000010010… |
… | …00011011000111001 |
3 | 111200122100202201111 |
4 | 10330021003120321 |
5 | 41330304122213 |
6 | 2234150320321 |
7 | 245303013253 |
oct | 47411033071 |
9 | 14618322644 |
10 | 5303973433 |
11 | 2281a55820 |
12 | 10403590a1 |
13 | 666b1b125 |
14 | 3845cacd3 |
15 | 21099ca3d |
hex | 13c243639 |
5303973433 has 4 divisors (see below), whose sum is σ = 5786152848. Its totient is φ = 4821794020.
The previous prime is 5303973407. The next prime is 5303973439. The reversal of 5303973433 is 3343793035.
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 5303973433 - 25 = 5303973401 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5303973439) 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, 241089691 + ... + 241089712.
It is an arithmetic number, because the mean of its divisors is an integer number (1446538212).
Almost surely, 25303973433 is an apocalyptic number.
It is an amenable number.
5303973433 is a deficient number, since it is larger than the sum of its proper divisors (482179415).
5303973433 is a wasteful number, since it uses less digits than its factorization.
5303973433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482179414.
The product of its (nonzero) digits is 306180, while the sum is 40.
The square root of 5303973433 is about 72828.3834298140. The cubic root of 5303973433 is about 1743.9489989478.
The spelling of 5303973433 in words is "five billion, three hundred three million, nine hundred seventy-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •