Base | Representation |
---|---|
bin | 11110100100111111011… |
… | …111011011111000010011 |
3 | 21102212211111121002010101 |
4 | 132210333133123320103 |
5 | 233411432334304021 |
6 | 4245154213513231 |
7 | 304546164051613 |
oct | 36447737337023 |
9 | 7385744532111 |
10 | 2101304213011 |
11 | 7401814a1483 |
12 | 29b2b6642817 |
13 | 1231c9325593 |
14 | 739bcc0aa43 |
15 | 399d698aa91 |
hex | 1e93f7dbe13 |
2101304213011 has 8 divisors (see below), whose sum is σ = 2118938580000. Its totient is φ = 2083716935040.
The previous prime is 2101304212993. The next prime is 2101304213087. The reversal of 2101304213011 is 1103124031012.
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 2101304213011 - 25 = 2101304212979 is a prime.
It is a super-2 number, since 2×21013042130112 (a number of 25 digits) contains 22 as substring.
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 2101304213011.
It is not an unprimeable number, because it can be changed into a prime (2101304243011) 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, 11682630 + ... + 11861131.
It is an arithmetic number, because the mean of its divisors is an integer number (264867322500).
Almost surely, 22101304213011 is an apocalyptic number.
2101304213011 is a deficient number, since it is larger than the sum of its proper divisors (17634366989).
2101304213011 is a wasteful number, since it uses less digits than its factorization.
2101304213011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23544509.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 2101304213011 its reverse (1103124031012), we get a palindrome (3204428244023).
The spelling of 2101304213011 in words is "two trillion, one hundred one billion, three hundred four million, two hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •