Base | Representation |
---|---|
bin | 1001010010011010101111… |
… | …1101010000000111001111 |
3 | 1100011021000101110011022211 |
4 | 2110212223331100013033 |
5 | 2314303210142121221 |
6 | 33415201021051251 |
7 | 2102536300454116 |
oct | 224465375200717 |
9 | 40137011404284 |
10 | 10212022223311 |
11 | 3287992355567 |
12 | 118b1a96b6b27 |
13 | 590cb30c05ac |
14 | 27439bb74c7d |
15 | 12a988a776e1 |
hex | 949abf501cf |
10212022223311 has 8 divisors (see below), whose sum is σ = 10413404663040. Its totient is φ = 10011583027608.
The previous prime is 10212022223287. The next prime is 10212022223339. The reversal of 10212022223311 is 11332222021201.
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 10212022223311 - 211 = 10212022221263 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212022224311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 235789141 + ... + 235832446.
It is an arithmetic number, because the mean of its divisors is an integer number (1301675582880).
Almost surely, 210212022223311 is an apocalyptic number.
10212022223311 is a deficient number, since it is larger than the sum of its proper divisors (201382439729).
10212022223311 is an equidigital number, since it uses as much as digits as its factorization.
10212022223311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 471622013.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 10212022223311 its reverse (11332222021201), we get a palindrome (21544244244512).
The spelling of 10212022223311 in words is "ten trillion, two hundred twelve billion, twenty-two million, two hundred twenty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •