Base | Representation |
---|---|
bin | 110000000011111101… |
… | …0100100101010010101 |
3 | 100212102000121100210222 |
4 | 1200013322210222111 |
5 | 3142334233311013 |
6 | 115225343324125 |
7 | 10312455416351 |
oct | 1400772445225 |
9 | 325360540728 |
10 | 103212010133 |
11 | 3a854541931 |
12 | 180055b0645 |
13 | 996b0c4a5b |
14 | 4dd1894461 |
15 | 2a4120b508 |
hex | 1807ea4a95 |
103212010133 has 8 divisors (see below), whose sum is σ = 103965842400. Its totient is φ = 102458339568.
The previous prime is 103212010067. The next prime is 103212010147. The reversal of 103212010133 is 331010212301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103212010133 - 232 = 98917042837 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103212010183) 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 7 ways as a sum of consecutive naturals, for example, 1436810 + ... + 1506932.
It is an arithmetic number, because the mean of its divisors is an integer number (12995730300).
Almost surely, 2103212010133 is an apocalyptic number.
It is an amenable number.
103212010133 is a deficient number, since it is larger than the sum of its proper divisors (753832267).
103212010133 is a wasteful number, since it uses less digits than its factorization.
103212010133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80851.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 103212010133 its reverse (331010212301), we get a palindrome (434222222434).
The spelling of 103212010133 in words is "one hundred three billion, two hundred twelve million, ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •