Base | Representation |
---|---|
bin | 10010110110110001… |
… | …01001010111010101 |
3 | 222010111102212221101 |
4 | 21123120221113111 |
5 | 131213004402013 |
6 | 4352301350101 |
7 | 505601055415 |
oct | 113330512725 |
9 | 28114385841 |
10 | 10123122133 |
11 | 4325269543 |
12 | 1b66268331 |
13 | c543684c7 |
14 | 6c0652645 |
15 | 3e3acd8dd |
hex | 25b6295d5 |
10123122133 has 8 divisors (see below), whose sum is σ = 10542483000. Its totient is φ = 9708447168.
The previous prime is 10123122131. The next prime is 10123122167. The reversal of 10123122133 is 33122132101.
It can be written as a sum of positive squares in 4 ways, for example, as 220284964 + 9902837169 = 14842^2 + 99513^2 .
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 10123122133 - 21 = 10123122131 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10123122133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10123122131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1167066 + ... + 1175707.
It is an arithmetic number, because the mean of its divisors is an integer number (1317810375).
Almost surely, 210123122133 is an apocalyptic number.
It is an amenable number.
10123122133 is a deficient number, since it is larger than the sum of its proper divisors (419360867).
10123122133 is a wasteful number, since it uses less digits than its factorization.
10123122133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2342951.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 10123122133 its reverse (33122132101), we get a palindrome (43245254234).
The spelling of 10123122133 in words is "ten billion, one hundred twenty-three million, one hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •