Base | Representation |
---|---|
bin | 100110101001… |
… | …111001111011 |
3 | 201001211000120 |
4 | 212221321323 |
5 | 10043224430 |
6 | 1001104323 |
7 | 152062416 |
oct | 46517173 |
9 | 21054016 |
10 | 10133115 |
11 | 57a1183 |
12 | 34880a3 |
13 | 213a335 |
14 | 14bab7d |
15 | d52610 |
hex | 9a9e7b |
10133115 has 8 divisors (see below), whose sum is σ = 16213008. Its totient is φ = 5404320.
The previous prime is 10133111. The next prime is 10133117. The reversal of 10133115 is 51133101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10133115 - 22 = 10133111 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15), and also a Moran number because the ratio is a prime number: 675541 = 10133115 / (1 + 0 + 1 + 3 + 3 + 1 + 1 + 5).
It is a junction number, because it is equal to n+sod(n) for n = 10133094 and 10133103.
It is not an unprimeable number, because it can be changed into a prime (10133111) 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, 337756 + ... + 337785.
It is an arithmetic number, because the mean of its divisors is an integer number (2026626).
Almost surely, 210133115 is an apocalyptic number.
10133115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10133115 is a deficient number, since it is larger than the sum of its proper divisors (6079893).
10133115 is an equidigital number, since it uses as much as digits as its factorization.
10133115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 675549.
The product of its (nonzero) digits is 45, while the sum is 15.
The square root of 10133115 is about 3183.2554091684. The cubic root of 10133115 is about 216.3952169281.
Adding to 10133115 its reverse (51133101), we get a palindrome (61266216).
The spelling of 10133115 in words is "ten million, one hundred thirty-three thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •