Base | Representation |
---|---|
bin | 1101101111110011110010… |
… | …01100010100000000011101 |
3 | 10222000221221120220220021002 |
4 | 12313321321030110000131 |
5 | 12430242031323200221 |
6 | 144143250514120045 |
7 | 6240021622442525 |
oct | 667717114240035 |
9 | 128027846826232 |
10 | 30230013100061 |
11 | 96a5527333585 |
12 | 3482942280025 |
13 | 13b38a775c118 |
14 | 7671d7526685 |
15 | 3765430b380b |
hex | 1b7e7931401d |
30230013100061 has 2 divisors, whose sum is σ = 30230013100062. Its totient is φ = 30230013100060.
The previous prime is 30230013100057. The next prime is 30230013100103. The reversal of 30230013100061 is 16000131003203.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28583939496025 + 1646073604036 = 5346395^2 + 1282994^2 .
It is a cyclic number.
It is not a de Polignac number, because 30230013100061 - 22 = 30230013100057 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30230013102061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15115006550030 + 15115006550031.
It is an arithmetic number, because the mean of its divisors is an integer number (15115006550031).
Almost surely, 230230013100061 is an apocalyptic number.
It is an amenable number.
30230013100061 is a deficient number, since it is larger than the sum of its proper divisors (1).
30230013100061 is an equidigital number, since it uses as much as digits as its factorization.
30230013100061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 30230013100061 its reverse (16000131003203), we get a palindrome (46230144103264).
The spelling of 30230013100061 in words is "thirty trillion, two hundred thirty billion, thirteen million, one hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •