Base | Representation |
---|---|
bin | 1000100110111111… |
… | …0011111100011001 |
3 | 12222001120120122112 |
4 | 2021233303330121 |
5 | 14213104341441 |
6 | 1021153002105 |
7 | 111161164445 |
oct | 21157637431 |
9 | 5861516575 |
10 | 2311012121 |
11 | a86562680 |
12 | 545b53335 |
13 | 2aaa2c5c2 |
14 | 17ccd7825 |
15 | d7d494eb |
hex | 89bf3f19 |
2311012121 has 8 divisors (see below), whose sum is σ = 2524317024. Its totient is φ = 2098242720.
The previous prime is 2311012111. The next prime is 2311012127. The reversal of 2311012121 is 1212101132.
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 2311012121 - 218 = 2310749977 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2311012096 and 2311012105.
It is not an unprimeable number, because it can be changed into a prime (2311012127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 124820 + ... + 142133.
It is an arithmetic number, because the mean of its divisors is an integer number (315539628).
Almost surely, 22311012121 is an apocalyptic number.
It is an amenable number.
2311012121 is a deficient number, since it is larger than the sum of its proper divisors (213304903).
2311012121 is a wasteful number, since it uses less digits than its factorization.
2311012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267751.
The product of its (nonzero) digits is 24, while the sum is 14.
The square root of 2311012121 is about 48072.9874357731. The cubic root of 2311012121 is about 1322.1094449365.
Adding to 2311012121 its reverse (1212101132), we get a palindrome (3523113253).
The spelling of 2311012121 in words is "two billion, three hundred eleven million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •