Base | Representation |
---|---|
bin | 1101110111101011001111… |
… | …10111000010011100100001 |
3 | 10222222210121201021210010012 |
4 | 12323311213313002130201 |
5 | 12444204111121000311 |
6 | 144511351413014305 |
7 | 6265400666012522 |
oct | 673654767023441 |
9 | 128883551253105 |
10 | 30500305250081 |
11 | 979a11a199447 |
12 | 35071b6624395 |
13 | 14032218a5674 |
14 | 776318d4c849 |
15 | 37d5b260678b |
hex | 1bbd67dc2721 |
30500305250081 has 2 divisors, whose sum is σ = 30500305250082. Its totient is φ = 30500305250080.
The previous prime is 30500305249937. The next prime is 30500305250087. The reversal of 30500305250081 is 18005250300503.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20664297640000 + 9836007610081 = 4545800^2 + 3136241^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30500305250081 is a prime.
It is a super-2 number, since 2×305003052500812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30500305250087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15250152625040 + 15250152625041.
It is an arithmetic number, because the mean of its divisors is an integer number (15250152625041).
Almost surely, 230500305250081 is an apocalyptic number.
It is an amenable number.
30500305250081 is a deficient number, since it is larger than the sum of its proper divisors (1).
30500305250081 is an equidigital number, since it uses as much as digits as its factorization.
30500305250081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 30500305250081 its reverse (18005250300503), we get a palindrome (48505555550584).
The spelling of 30500305250081 in words is "thirty trillion, five hundred billion, three hundred five million, two hundred fifty thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •