Base | Representation |
---|---|
bin | 100001011110100011100… |
… | …010011101011101001001 |
3 | 22010221010100222220200001 |
4 | 201132203202131131021 |
5 | 300143012103114423 |
6 | 4520505244443001 |
7 | 325131542515033 |
oct | 41364342353511 |
9 | 8127110886601 |
10 | 2300551223113 |
11 | 807727210180 |
12 | 311a41b49461 |
13 | 138c306410b0 |
14 | 7d4c0cbcc53 |
15 | 3ec98c71cad |
hex | 217a389d749 |
2300551223113 has 16 divisors (see below), whose sum is σ = 2740812342912. Its totient is φ = 1903341888000.
The previous prime is 2300551223111. The next prime is 2300551223123. The reversal of 2300551223113 is 3113221550032.
2300551223113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 2300551223113 - 21 = 2300551223111 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2300551223111) 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, 113284008 + ... + 113304313.
It is an arithmetic number, because the mean of its divisors is an integer number (171300771432).
Almost surely, 22300551223113 is an apocalyptic number.
It is an amenable number.
2300551223113 is a deficient number, since it is larger than the sum of its proper divisors (440261119799).
2300551223113 is a wasteful number, since it uses less digits than its factorization.
2300551223113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226588416.
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 2300551223113 its reverse (3113221550032), we get a palindrome (5413772773145).
The spelling of 2300551223113 in words is "two trillion, three hundred billion, five hundred fifty-one million, two hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •