Base | Representation |
---|---|
bin | 10010010110111… |
… | …111011110011101 |
3 | 210110120212222000 |
4 | 102112333132131 |
5 | 1112323021203 |
6 | 50321512513 |
7 | 10430046621 |
oct | 2226773635 |
9 | 713525860 |
10 | 308017053 |
11 | 14895a853 |
12 | 871a2739 |
13 | 4ba76c16 |
14 | 2cc9d181 |
15 | 1c0944a3 |
hex | 125bf79d |
308017053 has 8 divisors (see below), whose sum is σ = 456321600. Its totient is φ = 205344684.
The previous prime is 308017043. The next prime is 308017057. The reversal of 308017053 is 350710803.
It is not a de Polignac number, because 308017053 - 213 = 308008861 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 11408039 = 308017053 / (3 + 0 + 8 + 0 + 1 + 7 + 0 + 5 + 3).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (308017057) 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 7 ways as a sum of consecutive naturals, for example, 5703993 + ... + 5704046.
It is an arithmetic number, because the mean of its divisors is an integer number (57040200).
Almost surely, 2308017053 is an apocalyptic number.
It is an amenable number.
308017053 is a deficient number, since it is larger than the sum of its proper divisors (148304547).
308017053 is a wasteful number, since it uses less digits than its factorization.
308017053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11408048 (or 11408042 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 308017053 is about 17550.4146104871. The cubic root of 308017053 is about 675.3438051032.
Adding to 308017053 its reverse (350710803), we get a palindrome (658727856).
The spelling of 308017053 in words is "three hundred eight million, seventeen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •