Base | Representation |
---|---|
bin | 1111010010110… |
… | …11011110000101 |
3 | 22221102100210102 |
4 | 13221123132011 |
5 | 230321112213 |
6 | 20421533445 |
7 | 3115353125 |
oct | 751333605 |
9 | 287370712 |
10 | 128300933 |
11 | 66471432 |
12 | 36b74285 |
13 | 20772317 |
14 | 1307ac85 |
15 | b3e5158 |
hex | 7a5b785 |
128300933 has 2 divisors, whose sum is σ = 128300934. Its totient is φ = 128300932.
The previous prime is 128300903. The next prime is 128300951. The reversal of 128300933 is 339003821.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 128300929 + 4 = 11327^2 + 2^2 .
It is a cyclic number.
It is not a de Polignac number, because 128300933 - 214 = 128284549 is a prime.
It is a super-2 number, since 2×1283009332 = 32922258817340978, which contains 22 as substring.
It is equal to p7287113 and since 128300933 and 7287113 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 128300896 and 128300905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (128300903) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 64150466 + 64150467.
It is an arithmetic number, because the mean of its divisors is an integer number (64150467).
Almost surely, 2128300933 is an apocalyptic number.
It is an amenable number.
128300933 is a deficient number, since it is larger than the sum of its proper divisors (1).
128300933 is an equidigital number, since it uses as much as digits as its factorization.
128300933 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 29.
The square root of 128300933 is about 11327.0001765693. Note that the first 3 decimals coincide. The cubic root of 128300933 is about 504.3630606613.
The spelling of 128300933 in words is "one hundred twenty-eight million, three hundred thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •