Base | Representation |
---|---|
bin | 11011110000111100101110… |
… | …110001110101110100011011 |
3 | 121000100200211112201122010102 |
4 | 123300330232301311310123 |
5 | 112001131312000310021 |
6 | 1111413004033210015 |
7 | 34502141262204605 |
oct | 3360745661656433 |
9 | 530320745648112 |
10 | 122111000010011 |
11 | 359a9a91095461 |
12 | 11841b1aa0090b |
13 | 531a0303cc82c |
14 | 22222bd854175 |
15 | e1b5c241000b |
hex | 6f0f2ec75d1b |
122111000010011 has 16 divisors (see below), whose sum is σ = 129870374192160. Its totient is φ = 114485008711680.
The previous prime is 122111000009983. The next prime is 122111000010029. The reversal of 122111000010011 is 110010000111221.
It is a cyclic number.
It is not a de Polignac number, because 122111000010011 - 222 = 122110995815707 is a prime.
It is a super-2 number, since 2×1221110000100112 (a number of 29 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 = 122111000009974 and 122111000010001.
It is not an unprimeable number, because it can be changed into a prime (122111000010511) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30868295 + ... + 34598751.
It is an arithmetic number, because the mean of its divisors is an integer number (8116898387010).
Almost surely, 2122111000010011 is an apocalyptic number.
122111000010011 is a deficient number, since it is larger than the sum of its proper divisors (7759374182149).
122111000010011 is a wasteful number, since it uses less digits than its factorization.
122111000010011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3748334.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 122111000010011 its reverse (110010000111221), we get a palindrome (232121000121232).
The spelling of 122111000010011 in words is "one hundred twenty-two trillion, one hundred eleven billion, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •