Base | Representation |
---|---|
bin | 1001010010011011111001… |
… | …0111010000101100001111 |
3 | 1100011021210220112020021011 |
4 | 2110212332113100230033 |
5 | 2314304323221000221 |
6 | 33415251411550051 |
7 | 2102550040340023 |
oct | 224467627205417 |
9 | 40137726466234 |
10 | 10212331031311 |
11 | 32880306a5592 |
12 | 118b274bbb327 |
13 | 591032083516 |
14 | 2743cab9c383 |
15 | 12a9a5c261e1 |
hex | 949be5d0b0f |
10212331031311 has 8 divisors (see below), whose sum is σ = 10912258740240. Its totient is φ = 9523425806208.
The previous prime is 10212331031297. The next prime is 10212331031333. The reversal of 10212331031311 is 11313013321201.
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 10212331031311 - 29 = 10212331030799 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 (10212331031351) 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, 2755619041 + ... + 2755622746.
It is an arithmetic number, because the mean of its divisors is an integer number (1364032342530).
Almost surely, 210212331031311 is an apocalyptic number.
10212331031311 is a deficient number, since it is larger than the sum of its proper divisors (699927708929).
10212331031311 is a wasteful number, since it uses less digits than its factorization.
10212331031311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5511241913.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 10212331031311 its reverse (11313013321201), we get a palindrome (21525344352512).
The spelling of 10212331031311 in words is "ten trillion, two hundred twelve billion, three hundred thirty-one million, thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •