Base | Representation |
---|---|
bin | 11011110000111110110011… |
… | …110100010010011000010011 |
3 | 121000100220121002122112121111 |
4 | 123300332303310102120103 |
5 | 112001200344344133021 |
6 | 1111414013325034151 |
7 | 34502250504036400 |
oct | 3360766364223023 |
9 | 530326532575544 |
10 | 122113232021011 |
11 | 359aaa26a99350 |
12 | 118424423b5957 |
13 | 531a2c795b5ba |
14 | 22224520652a7 |
15 | e1b6a33518e1 |
hex | 6f0fb3d12613 |
122113232021011 has 24 divisors (see below), whose sum is σ = 155077091813376. Its totient is φ = 95083559943120.
The previous prime is 122113232021009. The next prime is 122113232021071. The reversal of 122113232021011 is 110120232311221.
It is a happy number.
It is not a de Polignac number, because 122113232021011 - 21 = 122113232021009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122113232021071) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 82129011 + ... + 83602636.
It is an arithmetic number, because the mean of its divisors is an integer number (6461545492224).
Almost surely, 2122113232021011 is an apocalyptic number.
122113232021011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
122113232021011 is a deficient number, since it is larger than the sum of its proper divisors (32963859792365).
122113232021011 is a wasteful number, since it uses less digits than its factorization.
122113232021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165733039 (or 165733032 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 122113232021011 its reverse (110120232311221), we get a palindrome (232233464332232).
The spelling of 122113232021011 in words is "one hundred twenty-two trillion, one hundred thirteen billion, two hundred thirty-two million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •