Base | Representation |
---|---|
bin | 111000010110000101… |
… | …1001111110101000011 |
3 | 102120022201021120101211 |
4 | 1300230023033311003 |
5 | 3440302024331321 |
6 | 131330422510551 |
7 | 11512332662320 |
oct | 1605413176503 |
9 | 376281246354 |
10 | 121000230211 |
11 | 47352525963 |
12 | 1b54a895457 |
13 | b5444a5273 |
14 | 5bdc113b47 |
15 | 3232bd00e1 |
hex | 1c2c2cfd43 |
121000230211 has 16 divisors (see below), whose sum is σ = 146924616960. Its totient is φ = 97337535840.
The previous prime is 121000230203. The next prime is 121000230227. The reversal of 121000230211 is 112032000121.
It is a cyclic number.
It is not a de Polignac number, because 121000230211 - 23 = 121000230203 is a prime.
It is a super-3 number, since 3×1210002302113 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121000230191 and 121000230200.
It is not an unprimeable number, because it can be changed into a prime (121000230311) 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 15 ways as a sum of consecutive naturals, for example, 4237060 + ... + 4265521.
It is an arithmetic number, because the mean of its divisors is an integer number (9182788560).
Almost surely, 2121000230211 is an apocalyptic number.
121000230211 is a deficient number, since it is larger than the sum of its proper divisors (25924386749).
121000230211 is a wasteful number, since it uses less digits than its factorization.
121000230211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8502714.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 121000230211 its reverse (112032000121), we get a palindrome (233032230332).
The spelling of 121000230211 in words is "one hundred twenty-one billion, two hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.222 sec. • engine limits •