Base | Representation |
---|---|
bin | 100110100111… |
… | …001110010101 |
3 | 201001020221211 |
4 | 212213032111 |
5 | 10042402013 |
6 | 1000541421 |
7 | 152015410 |
oct | 46471625 |
9 | 21036854 |
10 | 10122133 |
11 | 57939aa |
12 | 3481871 |
13 | 2135338 |
14 | 14b6b77 |
15 | d4e23d |
hex | 9a7395 |
10122133 has 4 divisors (see below), whose sum is σ = 11568160. Its totient is φ = 8676108.
The previous prime is 10122113. The next prime is 10122143. The reversal of 10122133 is 33122101.
10122133 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 10122133 - 29 = 10121621 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10122113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 723003 + ... + 723016.
It is an arithmetic number, because the mean of its divisors is an integer number (2892040).
Almost surely, 210122133 is an apocalyptic number.
It is an amenable number.
10122133 is a deficient number, since it is larger than the sum of its proper divisors (1446027).
10122133 is an equidigital number, since it uses as much as digits as its factorization.
10122133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1446026.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 10122133 is about 3181.5299778566. The cubic root of 10122133 is about 216.3170142135.
Adding to 10122133 its reverse (33122101), we get a palindrome (43244234).
The spelling of 10122133 in words is "ten million, one hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •