Base | Representation |
---|---|
bin | 1101110010101110000001… |
… | …11100011000100010111101 |
3 | 10222101112000221001012000111 |
4 | 12321113000330120202331 |
5 | 12433411320242203314 |
6 | 144301224332430021 |
7 | 6250161462623056 |
oct | 671270074304275 |
9 | 128345027035014 |
10 | 30330001131709 |
11 | 9733976a34684 |
12 | 349a1a8018311 |
13 | 13c015093b0a6 |
14 | 76bda0b4d72d |
15 | 378e46236ec4 |
hex | 1b95c0f188bd |
30330001131709 has 2 divisors, whose sum is σ = 30330001131710. Its totient is φ = 30330001131708.
The previous prime is 30330001131707. The next prime is 30330001131719. The reversal of 30330001131709 is 90713110003303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 24056964944100 + 6273036187609 = 4904790^2 + 2504603^2 .
It is a cyclic number.
It is not a de Polignac number, because 30330001131709 - 21 = 30330001131707 is a prime.
Together with 30330001131707, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30330001131707) 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, 15165000565854 + 15165000565855.
It is an arithmetic number, because the mean of its divisors is an integer number (15165000565855).
Almost surely, 230330001131709 is an apocalyptic number.
It is an amenable number.
30330001131709 is a deficient number, since it is larger than the sum of its proper divisors (1).
30330001131709 is an equidigital number, since it uses as much as digits as its factorization.
30330001131709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5103, while the sum is 31.
The spelling of 30330001131709 in words is "thirty trillion, three hundred thirty billion, one million, one hundred thirty-one thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •