Base | Representation |
---|---|
bin | 111000110111001100… |
… | …1101100000100000101 |
3 | 102200012010222101021010 |
4 | 1301232121230010011 |
5 | 4000040443442013 |
6 | 132032553112433 |
7 | 11552014012236 |
oct | 1615631540405 |
9 | 380163871233 |
10 | 122111312133 |
11 | 4787271a188 |
12 | 1b7ba9b8719 |
13 | b6907360a5 |
14 | 5ca58d908d |
15 | 329a5047c3 |
hex | 1c6e66c105 |
122111312133 has 8 divisors (see below), whose sum is σ = 162817551648. Its totient is φ = 81406307024.
The previous prime is 122111312111. The next prime is 122111312143. The reversal of 122111312133 is 331213111221.
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 122111312133 - 25 = 122111312101 is a prime.
It is a super-2 number, since 2×1221113121332 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122111312143) 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, 45810 + ... + 496307.
It is an arithmetic number, because the mean of its divisors is an integer number (20352193956).
Almost surely, 2122111312133 is an apocalyptic number.
It is an amenable number.
122111312133 is a deficient number, since it is larger than the sum of its proper divisors (40706239515).
122111312133 is an equidigital number, since it uses as much as digits as its factorization.
122111312133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 617203.
The product of its digits is 216, while the sum is 21.
Adding to 122111312133 its reverse (331213111221), we get a palindrome (453324423354).
The spelling of 122111312133 in words is "one hundred twenty-two billion, one hundred eleven million, three hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •