Base | Representation |
---|---|
bin | 100000011101001000010… |
… | …000011111100000111001 |
3 | 21220012210110111202002221 |
4 | 200131020100133200321 |
5 | 243020123334401221 |
6 | 4424330311524041 |
7 | 320063630560012 |
oct | 40351020374071 |
9 | 7805713452087 |
10 | 2230300309561 |
11 | 78a957421035 |
12 | 3002b7089621 |
13 | 1324162242ac |
14 | 79d38c30009 |
15 | 3d0365eb541 |
hex | 2074841f839 |
2230300309561 has 27 divisors (see below), whose sum is σ = 2385082692741. Its totient is φ = 2085254976024.
The previous prime is 2230300309547. The next prime is 2230300309597. The reversal of 2230300309561 is 1659030030322.
The square root of 2230300309561 is 1493419.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 2230300309561 - 235 = 2195940571193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2230300309661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 2355121290 + ... + 2355122236.
Almost surely, 22230300309561 is an apocalyptic number.
2230300309561 is the 1493419-th square number.
2230300309561 is the 746710-th centered octagonal number.
It is an amenable number.
2230300309561 is a deficient number, since it is larger than the sum of its proper divisors (154782383180).
2230300309561 is an frugal number, since it uses more digits than its factorization.
2230300309561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2098 (or 1049 counting only the distinct ones).
The product of its (nonzero) digits is 29160, while the sum is 34.
Adding to 2230300309561 its reverse (1659030030322), we get a palindrome (3889330339883).
The spelling of 2230300309561 in words is "two trillion, two hundred thirty billion, three hundred million, three hundred nine thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •