Base | Representation |
---|---|
bin | 1001001101000100101110… |
… | …0110011000001110111111 |
3 | 1022211111000221000002020022 |
4 | 2103101023212120032333 |
5 | 2311302143043120221 |
6 | 33305054430242355 |
7 | 2063106161503436 |
oct | 223211346301677 |
9 | 38744027002208 |
10 | 10120211301311 |
11 | 3251a5949aa21 |
12 | 11754463563bb |
13 | 585441055b47 |
14 | 26db6c55a11d |
15 | 1283b37364ab |
hex | 9344b9983bf |
10120211301311 has 32 divisors (see below), whose sum is σ = 10854056371200. Its totient is φ = 9408549427200.
The previous prime is 10120211301293. The next prime is 10120211301337. The reversal of 10120211301311 is 11310311202101.
It is a cyclic number.
It is not a de Polignac number, because 10120211301311 - 26 = 10120211301247 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10120211301311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10120211301341) 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 31 ways as a sum of consecutive naturals, for example, 109478711 + ... + 109571111.
It is an arithmetic number, because the mean of its divisors is an integer number (339189261600).
Almost surely, 210120211301311 is an apocalyptic number.
10120211301311 is a deficient number, since it is larger than the sum of its proper divisors (733845069889).
10120211301311 is a wasteful number, since it uses less digits than its factorization.
10120211301311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93039.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 10120211301311 its reverse (11310311202101), we get a palindrome (21430522503412).
The spelling of 10120211301311 in words is "ten trillion, one hundred twenty billion, two hundred eleven million, three hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •