Base | Representation |
---|---|
bin | 10011001111101011… |
… | …11101101011110101 |
3 | 222200001201210111120 |
4 | 21213311331223311 |
5 | 132130011243013 |
6 | 4425125254153 |
7 | 514016456016 |
oct | 114765755365 |
9 | 28601653446 |
10 | 10332134133 |
11 | 4422247332 |
12 | 2004264359 |
13 | c88759749 |
14 | 7002dd00d |
15 | 407118123 |
hex | 267d7daf5 |
10332134133 has 8 divisors (see below), whose sum is σ = 13777392288. Its totient is φ = 6887482704.
The previous prime is 10332134101. The next prime is 10332134167. The reversal of 10332134133 is 33143123301.
It is a happy number.
10332134133 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10332134133 - 25 = 10332134101 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10332134933) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 110335 + ... + 181212.
It is an arithmetic number, because the mean of its divisors is an integer number (1722174036).
Almost surely, 210332134133 is an apocalyptic number.
It is an amenable number.
10332134133 is a deficient number, since it is larger than the sum of its proper divisors (3445258155).
10332134133 is a wasteful number, since it uses less digits than its factorization.
10332134133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303363.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 10332134133 its reverse (33143123301), we get a palindrome (43475257434).
The spelling of 10332134133 in words is "ten billion, three hundred thirty-two million, one hundred thirty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •