Base | Representation |
---|---|
bin | 1001010010010111010100… |
… | …0000011110011000011111 |
3 | 1100011011122010201200112022 |
4 | 2110211311000132120133 |
5 | 2314244313140240221 |
6 | 33414525325330355 |
7 | 2102504404435151 |
oct | 224456500363037 |
9 | 40134563650468 |
10 | 10211100321311 |
11 | 3287559a2398a |
12 | 118ab90a069bb |
13 | 590b970c8b56 |
14 | 274311556ad1 |
15 | 12a932b714ab |
hex | 9497501e61f |
10211100321311 has 8 divisors (see below), whose sum is σ = 10218486485664. Its totient is φ = 10203714892000.
The previous prime is 10211100321287. The next prime is 10211100321379. The reversal of 10211100321311 is 11312300111201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10211100321311 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10211100321311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211103321311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29315105 + ... + 29661381.
It is an arithmetic number, because the mean of its divisors is an integer number (1277310810708).
Almost surely, 210211100321311 is an apocalyptic number.
10211100321311 is a deficient number, since it is larger than the sum of its proper divisors (7386164353).
10211100321311 is a wasteful number, since it uses less digits than its factorization.
10211100321311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 367521.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 10211100321311 its reverse (11312300111201), we get a palindrome (21523400432512).
The spelling of 10211100321311 in words is "ten trillion, two hundred eleven billion, one hundred million, three hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •