Base | Representation |
---|---|
bin | 101111111111111010011110… |
… | …111111110010111101001001 |
3 | 1000200102222210120110220222010 |
4 | 233333322132333302331021 |
5 | 210132131413342403223 |
6 | 2024550051011050133 |
7 | 62315331322465263 |
oct | 5777723677627511 |
9 | 1020388716426863 |
10 | 211100310122313 |
11 | 61299158765897 |
12 | 1b8147a28a0949 |
13 | 90a389b5258a1 |
14 | 3a1b4494a6b33 |
15 | 196130bce1393 |
hex | bffe9eff2f49 |
211100310122313 has 16 divisors (see below), whose sum is σ = 284206109109440. Its totient is φ = 139369126222656.
The previous prime is 211100310122281. The next prime is 211100310122327. The reversal of 211100310122313 is 313221013001112.
It is not a de Polignac number, because 211100310122313 - 25 = 211100310122281 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 211100310122313.
It is not an unprimeable number, because it can be changed into a prime (211100310121313) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 637410970 + ... + 637742067.
It is an arithmetic number, because the mean of its divisors is an integer number (17762881819340).
Almost surely, 2211100310122313 is an apocalyptic number.
It is an amenable number.
211100310122313 is a deficient number, since it is larger than the sum of its proper divisors (73105798987127).
211100310122313 is a wasteful number, since it uses less digits than its factorization.
211100310122313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1275153576.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 211100310122313 its reverse (313221013001112), we get a palindrome (524321323123425).
The spelling of 211100310122313 in words is "two hundred eleven trillion, one hundred billion, three hundred ten million, one hundred twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •