Base | Representation |
---|---|
bin | 100000001010001110111… |
… | …010111101110000010001 |
3 | 21211021102110121122100220 |
4 | 200022032322331300101 |
5 | 242202100304341423 |
6 | 4411133125503253 |
7 | 315445063440222 |
oct | 40121672756021 |
9 | 7737373548326 |
10 | 2210011012113 |
11 | 782295668613 |
12 | 2b8394271b29 |
13 | 130531928148 |
14 | 78d7235d249 |
15 | 3c74a2879e3 |
hex | 2028eebdc11 |
2210011012113 has 8 divisors (see below), whose sum is σ = 2947858619328. Its totient is φ = 1472752039824.
The previous prime is 2210011012043. The next prime is 2210011012147. The reversal of 2210011012113 is 3112101100122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2210011012113 - 221 = 2210008914961 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2210011012092 and 2210011012101.
It is not an unprimeable number, because it can be changed into a prime (2210011012163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 147149970 + ... + 147164987.
It is an arithmetic number, because the mean of its divisors is an integer number (368482327416).
Almost surely, 22210011012113 is an apocalyptic number.
It is an amenable number.
2210011012113 is a deficient number, since it is larger than the sum of its proper divisors (737847607215).
2210011012113 is a wasteful number, since it uses less digits than its factorization.
2210011012113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294317463.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 2210011012113 its reverse (3112101100122), we get a palindrome (5322112112235).
The spelling of 2210011012113 in words is "two trillion, two hundred ten billion, eleven million, twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •