Base | Representation |
---|---|
bin | 100010001110001010001010… |
… | …0000110101010001011001101 |
3 | 1110110210120110220101202111001 |
4 | 1010130110110012222023031 |
5 | 303423244332234330333 |
6 | 2544111303550500301 |
7 | 120255323505363565 |
oct | 10434242406521315 |
9 | 1413716426352431 |
10 | 301013120230093 |
11 | 87a03a46a79487 |
12 | 29916438b04691 |
13 | cbc6552949bcb |
14 | 5449181583da5 |
15 | 24c0096d75b7d |
hex | 111c5141aa2cd |
301013120230093 has 2 divisors, whose sum is σ = 301013120230094. Its totient is φ = 301013120230092.
The previous prime is 301013120230091. The next prime is 301013120230103. The reversal of 301013120230093 is 390032021310103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 300145992377284 + 867127852809 = 17324722^2 + 931197^2 .
It is a cyclic number.
It is not a de Polignac number, because 301013120230093 - 21 = 301013120230091 is a prime.
Together with 301013120230091, 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 (301013120230091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 150506560115046 + 150506560115047.
It is an arithmetic number, because the mean of its divisors is an integer number (150506560115047).
Almost surely, 2301013120230093 is an apocalyptic number.
It is an amenable number.
301013120230093 is a deficient number, since it is larger than the sum of its proper divisors (1).
301013120230093 is an equidigital number, since it uses as much as digits as its factorization.
301013120230093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2916, while the sum is 28.
Adding to 301013120230093 its reverse (390032021310103), we get a palindrome (691045141540196).
The spelling of 301013120230093 in words is "three hundred one trillion, thirteen billion, one hundred twenty million, two hundred thirty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •