Base | Representation |
---|---|
bin | 101101010011001101110… |
… | …110101111100100101101 |
3 | 102000121020000112012121221 |
4 | 231103031312233210231 |
5 | 402000421030032341 |
6 | 10342032544023341 |
7 | 440623201266160 |
oct | 55231566574455 |
9 | 12017200465557 |
10 | 3113010002221 |
11 | aa0246a99029 |
12 | 4233a4901b51 |
13 | 19772b803bc2 |
14 | aa955b67ad7 |
15 | 55e9ac08ed1 |
hex | 2d4cddaf92d |
3113010002221 has 16 divisors (see below), whose sum is σ = 3757897842688. Its totient is φ = 2522168636400.
The previous prime is 3113010002203. The next prime is 3113010002269. The reversal of 3113010002221 is 1222000103113.
It is not a de Polignac number, because 3113010002221 - 211 = 3113010000173 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3113010002195 and 3113010002204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3113010005221) 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, 166800765 + ... + 166819426.
It is an arithmetic number, because the mean of its divisors is an integer number (234868615168).
Almost surely, 23113010002221 is an apocalyptic number.
3113010002221 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
3113010002221 is a deficient number, since it is larger than the sum of its proper divisors (644887840467).
3113010002221 is a wasteful number, since it uses less digits than its factorization.
3113010002221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333620272.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 3113010002221 its reverse (1222000103113), we get a palindrome (4335010105334).
The spelling of 3113010002221 in words is "three trillion, one hundred thirteen billion, ten million, two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •