Base | Representation |
---|---|
bin | 1101110010001101000011… |
… | …11100001101000111000101 |
3 | 10222022211100101100112021221 |
4 | 12321012201330031013011 |
5 | 12433114043041400424 |
6 | 144245140124040341 |
7 | 6245664036210145 |
oct | 671064174150705 |
9 | 128284311315257 |
10 | 30312301121989 |
11 | 972741381a377 |
12 | 34968883930b1 |
13 | 13bb58c904063 |
14 | 76b1a20d2925 |
15 | 37875c3899e4 |
hex | 1b91a1f0d1c5 |
30312301121989 has 2 divisors, whose sum is σ = 30312301121990. Its totient is φ = 30312301121988.
The previous prime is 30312301121957. The next prime is 30312301122031. The reversal of 30312301121989 is 98912110321303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28474763630625 + 1837537491364 = 5336175^2 + 1355558^2 .
It is an emirp because it is prime and its reverse (98912110321303) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30312301121989 - 25 = 30312301121957 is a prime.
It is a super-2 number, since 2×303123011219892 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30312301121909) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15156150560994 + 15156150560995.
It is an arithmetic number, because the mean of its divisors is an integer number (15156150560995).
Almost surely, 230312301121989 is an apocalyptic number.
It is an amenable number.
30312301121989 is a deficient number, since it is larger than the sum of its proper divisors (1).
30312301121989 is an equidigital number, since it uses as much as digits as its factorization.
30312301121989 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 69984, while the sum is 43.
The spelling of 30312301121989 in words is "thirty trillion, three hundred twelve billion, three hundred one million, one hundred twenty-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •