Base | Representation |
---|---|
bin | 1001111000010010… |
… | …10110000101110001 |
3 | 111200122111122210112 |
4 | 10330021112011301 |
5 | 41330314100113 |
6 | 2234152111105 |
7 | 245303452502 |
oct | 47411260561 |
9 | 14618448715 |
10 | 5304050033 |
11 | 2281aa8327 |
12 | 1040395495 |
13 | 666b46c59 |
14 | 38460aba9 |
15 | 2109b55a8 |
hex | 13c256171 |
5304050033 has 8 divisors (see below), whose sum is σ = 5725512000. Its totient is φ = 4898492368.
The previous prime is 5304050029. The next prime is 5304050069. The reversal of 5304050033 is 3300504035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5304050033 - 22 = 5304050029 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5304049990 and 5304050008.
It is not an unprimeable number, because it can be changed into a prime (5304050083) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3975383 + ... + 3976716.
It is an arithmetic number, because the mean of its divisors is an integer number (715689000).
Almost surely, 25304050033 is an apocalyptic number.
It is an amenable number.
5304050033 is a deficient number, since it is larger than the sum of its proper divisors (421461967).
5304050033 is a wasteful number, since it uses less digits than its factorization.
5304050033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7952151.
The product of its (nonzero) digits is 2700, while the sum is 23.
The square root of 5304050033 is about 72828.9093217796. The cubic root of 5304050033 is about 1743.9573942796.
Adding to 5304050033 its reverse (3300504035), we get a palindrome (8604554068).
The spelling of 5304050033 in words is "five billion, three hundred four million, fifty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •