Base | Representation |
---|---|
bin | 100010001000011000111110… |
… | …1001010111110110011001111 |
3 | 1110100222210002212122110112022 |
4 | 1010100301331022332303033 |
5 | 303322302200342133241 |
6 | 2542303150330200355 |
7 | 120144126152655233 |
oct | 10420617512766317 |
9 | 1410883085573468 |
10 | 300220314021071 |
11 | 877287a15a0394 |
12 | 2980885b8830bb |
13 | cb698671985b2 |
14 | 541ca527c25c3 |
15 | 24a96453cc54b |
hex | 1110c7d2beccf |
300220314021071 has 2 divisors, whose sum is σ = 300220314021072. Its totient is φ = 300220314021070.
The previous prime is 300220314021037. The next prime is 300220314021091. The reversal of 300220314021071 is 170120413022003.
It is a strong prime.
It is an emirp because it is prime and its reverse (170120413022003) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 300220314021071 - 230 = 300219240279247 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 300220314021071.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (300220314021011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 150110157010535 + 150110157010536.
It is an arithmetic number, because the mean of its divisors is an integer number (150110157010536).
Almost surely, 2300220314021071 is an apocalyptic number.
300220314021071 is a deficient number, since it is larger than the sum of its proper divisors (1).
300220314021071 is an equidigital number, since it uses as much as digits as its factorization.
300220314021071 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2016, while the sum is 26.
Adding to 300220314021071 its reverse (170120413022003), we get a palindrome (470340727043074).
The spelling of 300220314021071 in words is "three hundred trillion, two hundred twenty billion, three hundred fourteen million, twenty-one thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •