Base | Representation |
---|---|
bin | 100110101001… |
… | …111010100000 |
3 | 201001211001221 |
4 | 212221322200 |
5 | 10043230102 |
6 | 1001104424 |
7 | 152062501 |
oct | 46517240 |
9 | 21054057 |
10 | 10133152 |
11 | 57a1207 |
12 | 3488114 |
13 | 213a363 |
14 | 14baba8 |
15 | d52637 |
hex | 9a9ea0 |
10133152 has 12 divisors (see below), whose sum is σ = 19949706. Its totient is φ = 5066560.
The previous prime is 10133143. The next prime is 10133159. The reversal of 10133152 is 25133101.
It can be written as a sum of positive squares in only one way, i.e., 7160976 + 2972176 = 2676^2 + 1724^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is not an unprimeable number, because it can be changed into a prime (10133159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 158299 + ... + 158362.
Almost surely, 210133152 is an apocalyptic number.
It is an amenable number.
10133152 is a deficient number, since it is larger than the sum of its proper divisors (9816554).
10133152 is an equidigital number, since it uses as much as digits as its factorization.
10133152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 316671 (or 316663 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 10133152 is about 3183.2612208237. The cubic root of 10133152 is about 216.3954803092.
Adding to 10133152 its reverse (25133101), we get a palindrome (35266253).
The spelling of 10133152 in words is "ten million, one hundred thirty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •