Base | Representation |
---|---|
bin | 1011000101111… |
… | …01100011111101 |
3 | 20111002111011021 |
4 | 11202331203331 |
5 | 142310114013 |
6 | 13122224141 |
7 | 2206631050 |
oct | 542754375 |
9 | 214074137 |
10 | 93051133 |
11 | 4858576a |
12 | 271b5051 |
13 | 1637c956 |
14 | c502a97 |
15 | 8280a8d |
hex | 58bd8fd |
93051133 has 4 divisors (see below), whose sum is σ = 106344160. Its totient is φ = 79758108.
The previous prime is 93051131. The next prime is 93051137. The reversal of 93051133 is 33115039.
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, and also an emirpimes, since its reverse is a distinct semiprime: 33115039 = 71 ⋅466409.
It is a cyclic number.
It is not a de Polignac number, because 93051133 - 21 = 93051131 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 93051098 and 93051107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (93051131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6646503 + ... + 6646516.
It is an arithmetic number, because the mean of its divisors is an integer number (26586040).
Almost surely, 293051133 is an apocalyptic number.
It is an amenable number.
93051133 is a deficient number, since it is larger than the sum of its proper divisors (13293027).
93051133 is a wasteful number, since it uses less digits than its factorization.
93051133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13293026.
The product of its (nonzero) digits is 1215, while the sum is 25.
The square root of 93051133 is about 9646.3015192352. The cubic root of 93051133 is about 453.1485087954.
The spelling of 93051133 in words is "ninety-three million, fifty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •