Base | Representation |
---|---|
bin | 100000011101001000111… |
… | …001010011111111111101 |
3 | 21220012211012122101202122 |
4 | 200131020321103333331 |
5 | 243020134104312201 |
6 | 4424331333132325 |
7 | 320064120535343 |
oct | 40351071237775 |
9 | 7805735571678 |
10 | 2230311010301 |
11 | 78a96246a720 |
12 | 3002ba78a0a5 |
13 | 1324184ccaaa |
14 | 79d3a417993 |
15 | 3d037511e1b |
hex | 20748e53ffd |
2230311010301 has 16 divisors (see below), whose sum is σ = 2513888638848. Its totient is φ = 1961281358400.
The previous prime is 2230311010289. The next prime is 2230311010303. The reversal of 2230311010301 is 1030101130322.
It is a cyclic number.
It is not a de Polignac number, because 2230311010301 - 26 = 2230311010237 is a prime.
It is a super-2 number, since 2×22303110103012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2230311010301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2230311010303) 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, 26899286 + ... + 26982071.
It is an arithmetic number, because the mean of its divisors is an integer number (157118039928).
Almost surely, 22230311010301 is an apocalyptic number.
It is an amenable number.
2230311010301 is a deficient number, since it is larger than the sum of its proper divisors (283577628547).
2230311010301 is a wasteful number, since it uses less digits than its factorization.
2230311010301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53881492.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 2230311010301 its reverse (1030101130322), we get a palindrome (3260412140623).
The spelling of 2230311010301 in words is "two trillion, two hundred thirty billion, three hundred eleven million, ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •