Base | Representation |
---|---|
bin | 1101101111110111011101… |
… | …01111000101100101011111 |
3 | 10222001011001000200102121221 |
4 | 12313323232233011211133 |
5 | 12430310101144302203 |
6 | 144144214322034211 |
7 | 6240121526545246 |
oct | 667735657054537 |
9 | 128034030612557 |
10 | 30231985150303 |
11 | 96a6349520072 |
12 | 34831b27a8967 |
13 | 13b3b3019b761 |
14 | 7673433c795d |
15 | 37660b2a4abd |
hex | 1b7eeebc595f |
30231985150303 has 2 divisors, whose sum is σ = 30231985150304. Its totient is φ = 30231985150302.
The previous prime is 30231985150243. The next prime is 30231985150349. The reversal of 30231985150303 is 30305158913203.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30231985150303 is a prime.
It is a super-2 number, since 2×302319851503032 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30231985150303.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30231985150403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15115992575151 + 15115992575152.
It is an arithmetic number, because the mean of its divisors is an integer number (15115992575152).
Almost surely, 230231985150303 is an apocalyptic number.
30231985150303 is a deficient number, since it is larger than the sum of its proper divisors (1).
30231985150303 is an equidigital number, since it uses as much as digits as its factorization.
30231985150303 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 291600, while the sum is 43.
The spelling of 30231985150303 in words is "thirty trillion, two hundred thirty-one billion, nine hundred eighty-five million, one hundred fifty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •