Base | Representation |
---|---|
bin | 10011000001001111… |
… | …11111010001110101 |
3 | 222100121212002001020 |
4 | 21200213333101311 |
5 | 131403010431013 |
6 | 4405121451353 |
7 | 511016216103 |
oct | 114047772165 |
9 | 28317762036 |
10 | 10211030133 |
11 | 436a951087 |
12 | 1b8b7a0b59 |
13 | c69637185 |
14 | 6cc1b6c73 |
15 | 3eb695623 |
hex | 2609ff475 |
10211030133 has 8 divisors (see below), whose sum is σ = 13625018496. Its totient is φ = 6802197600.
The previous prime is 10211030117. The next prime is 10211030149. The reversal of 10211030133 is 33103011201.
It is an interprime number because it is at equal distance from previous prime (10211030117) and next prime (10211030149).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10211030133 - 24 = 10211030117 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211030153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1284333 + ... + 1292258.
It is an arithmetic number, because the mean of its divisors is an integer number (1703127312).
Almost surely, 210211030133 is an apocalyptic number.
It is an amenable number.
10211030133 is a deficient number, since it is larger than the sum of its proper divisors (3413988363).
10211030133 is a wasteful number, since it uses less digits than its factorization.
10211030133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2577915.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 10211030133 its reverse (33103011201), we get a palindrome (43314041334).
The spelling of 10211030133 in words is "ten billion, two hundred eleven million, thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •