Base | Representation |
---|---|
bin | 11110100100111111111… |
… | …001010101010110011011 |
3 | 21102212211222100222212211 |
4 | 132210333321111112123 |
5 | 233411441104031021 |
6 | 4245155015215551 |
7 | 304546305545614 |
oct | 36447771252633 |
9 | 7385758328784 |
10 | 2101311002011 |
11 | 740185309121 |
12 | 29b2b89775b7 |
13 | 1231ca861740 |
14 | 739bda96c0b |
15 | 399d737c3e1 |
hex | 1e93fe5559b |
2101311002011 has 8 divisors (see below), whose sum is σ = 2275592492880. Its totient is φ = 1928835537312.
The previous prime is 2101311002009. The next prime is 2101311002029. The reversal of 2101311002011 is 1102001131012.
It is a happy number.
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 2101311002011 - 21 = 2101311002009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2101311001982 and 2101311002000.
It is not an unprimeable number, because it can be changed into a prime (2101311002071) 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, 451504120 + ... + 451508773.
It is an arithmetic number, because the mean of its divisors is an integer number (284449061610).
Almost surely, 22101311002011 is an apocalyptic number.
2101311002011 is a deficient number, since it is larger than the sum of its proper divisors (174281490869).
2101311002011 is a wasteful number, since it uses less digits than its factorization.
2101311002011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 903013085.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 2101311002011 its reverse (1102001131012), we get a palindrome (3203312133023).
The spelling of 2101311002011 in words is "two trillion, one hundred one billion, three hundred eleven million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •