Base | Representation |
---|---|
bin | 111000110111001010… |
… | …1110111011010010001 |
3 | 102200012002002110122022 |
4 | 1301232111313122101 |
5 | 4000040214410113 |
6 | 132032515421225 |
7 | 11552002336535 |
oct | 1615625673221 |
9 | 380162073568 |
10 | 122110310033 |
11 | 478720a52a8 |
12 | 1b7ba5b4815 |
13 | b690474c2a |
14 | 5ca5717bc5 |
15 | 329a3a7908 |
hex | 1c6e577691 |
122110310033 has 8 divisors (see below), whose sum is σ = 123674793600. Its totient is φ = 120546296208.
The previous prime is 122110309973. The next prime is 122110310053. The reversal of 122110310033 is 330013011221.
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 122110310033 - 26 = 122110309969 is a prime.
It is a super-2 number, since 2×1221103100332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122110309993 and 122110310020.
It is not an unprimeable number, because it can be changed into a prime (122110310053) 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, 421535 + ... + 649547.
It is an arithmetic number, because the mean of its divisors is an integer number (15459349200).
Almost surely, 2122110310033 is an apocalyptic number.
It is an amenable number.
122110310033 is a deficient number, since it is larger than the sum of its proper divisors (1564483567).
122110310033 is an equidigital number, since it uses as much as digits as its factorization.
122110310033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234871.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 122110310033 its reverse (330013011221), we get a palindrome (452123321254).
The spelling of 122110310033 in words is "one hundred twenty-two billion, one hundred ten million, three hundred ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •