Base | Representation |
---|---|
bin | 11011101111010101011101… |
… | …010010001110000001101011 |
3 | 120222222002121111200100110202 |
4 | 123233111131102032001223 |
5 | 111442322211420200021 |
6 | 1111250024411102415 |
7 | 34461134325055034 |
oct | 3357253522160153 |
9 | 528862544610422 |
10 | 122000111100011 |
11 | 35966a581a8091 |
12 | 11824532441a0b |
13 | 530c73a9bcca1 |
14 | 221aba059da8b |
15 | e1878227ba0b |
hex | 6ef55d48e06b |
122000111100011 has 8 divisors (see below), whose sum is σ = 126228319614480. Its totient is φ = 117773323127712.
The previous prime is 122000111099981. The next prime is 122000111100059. The reversal of 122000111100011 is 110001111000221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122000111100011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122000111099965 and 122000111100001.
It is not an unprimeable number, because it can be changed into a prime (122000111100611) 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, 354960800 + ... + 355304333.
It is an arithmetic number, because the mean of its divisors is an integer number (15778539951810).
Almost surely, 2122000111100011 is an apocalyptic number.
122000111100011 is a deficient number, since it is larger than the sum of its proper divisors (4228208514469).
122000111100011 is an equidigital number, since it uses as much as digits as its factorization.
122000111100011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 710271085.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 122000111100011 its reverse (110001111000221), we get a palindrome (232001222100232).
The spelling of 122000111100011 in words is "one hundred twenty-two trillion, one hundred eleven million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •