Base | Representation |
---|---|
bin | 10001111001100011100… |
… | …010000010000001100111 |
3 | 11100120220221102012021012 |
4 | 101321203202002001213 |
5 | 130123100302342411 |
6 | 2341022422412435 |
7 | 154603205562563 |
oct | 21714342020147 |
9 | 4316827365235 |
10 | 1230030512231 |
11 | 434720180444 |
12 | 17a47a89111b |
13 | 8bcb70a3c81 |
14 | 43768a366a3 |
15 | 21ee134018b |
hex | 11e63882067 |
1230030512231 has 2 divisors, whose sum is σ = 1230030512232. Its totient is φ = 1230030512230.
The previous prime is 1230030512173. The next prime is 1230030512237. The reversal of 1230030512231 is 1322150300321.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1230030512231 is a prime.
It is a super-2 number, since 2×12300305122312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1230030512197 and 1230030512206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1230030512237) 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 as a sum of consecutive naturals, namely, 615015256115 + 615015256116.
It is an arithmetic number, because the mean of its divisors is an integer number (615015256116).
Almost surely, 21230030512231 is an apocalyptic number.
1230030512231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1230030512231 is an equidigital number, since it uses as much as digits as its factorization.
1230030512231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 1230030512231 its reverse (1322150300321), we get a palindrome (2552180812552).
The spelling of 1230030512231 in words is "one trillion, two hundred thirty billion, thirty million, five hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •