Base | Representation |
---|---|
bin | 100000000001111011111… |
… | …110000110001010100101 |
3 | 21210102102122212102010100 |
4 | 200001323332012022211 |
5 | 242030324400200201 |
6 | 4403101155014313 |
7 | 315011246626224 |
oct | 40017376061245 |
9 | 7712378772110 |
10 | 2201103131301 |
11 | 779534375948 |
12 | 2b6708b9a399 |
13 | 12c74228c559 |
14 | 78769286cbb |
15 | 3c3c8205886 |
hex | 2007bf862a5 |
2201103131301 has 12 divisors (see below), whose sum is σ = 3191460056928. Its totient is φ = 1461822610344.
The previous prime is 2201103131233. The next prime is 2201103131321. The reversal of 2201103131301 is 1031313011022.
2201103131301 is a `hidden beast` number, since 220 + 1 + 1 + 0 + 313 + 130 + 1 = 666.
It is not a de Polignac number, because 2201103131301 - 225 = 2201069576869 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201103131321) 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 11 ways as a sum of consecutive naturals, for example, 464953935 + ... + 464958668.
It is an arithmetic number, because the mean of its divisors is an integer number (265955004744).
Almost surely, 22201103131301 is an apocalyptic number.
It is an amenable number.
2201103131301 is a deficient number, since it is larger than the sum of its proper divisors (990356925627).
2201103131301 is a wasteful number, since it uses less digits than its factorization.
2201103131301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 929912872 (or 929912869 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 2201103131301 its reverse (1031313011022), we get a palindrome (3232416142323).
The spelling of 2201103131301 in words is "two trillion, two hundred one billion, one hundred three million, one hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •