Base | Representation |
---|---|
bin | 1101101111110100100101… |
… | …01000111101101001010001 |
3 | 10222001000001100021202011222 |
4 | 12313322102220331221101 |
5 | 12430243420122303131 |
6 | 144143401125014425 |
7 | 6240035325412442 |
oct | 667722250755121 |
9 | 128030040252158 |
10 | 30230440041041 |
11 | 96a572632a669 |
12 | 3482a41254415 |
13 | 13b3945044216 |
14 | 7672381012c9 |
15 | 37656a7e987b |
hex | 1b7e92a3da51 |
30230440041041 has 2 divisors, whose sum is σ = 30230440041042. Its totient is φ = 30230440041040.
The previous prime is 30230440041023. The next prime is 30230440041049. The reversal of 30230440041041 is 14014004403203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30100541068816 + 129898972225 = 5486396^2 + 360415^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30230440041041 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30230440041041.
It is not a weakly prime, because it can be changed into another prime (30230440041049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15115220020520 + 15115220020521.
It is an arithmetic number, because the mean of its divisors is an integer number (15115220020521).
Almost surely, 230230440041041 is an apocalyptic number.
It is an amenable number.
30230440041041 is a deficient number, since it is larger than the sum of its proper divisors (1).
30230440041041 is an equidigital number, since it uses as much as digits as its factorization.
30230440041041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 30230440041041 its reverse (14014004403203), we get a palindrome (44244444444244).
The spelling of 30230440041041 in words is "thirty trillion, two hundred thirty billion, four hundred forty million, forty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •