Base | Representation |
---|---|
bin | 1000110001010011000… |
… | …01010100001100000101 |
3 | 1001210211012111001102011 |
4 | 10120221201110030011 |
5 | 14414123120410041 |
6 | 350234034214221 |
7 | 30525410241466 |
oct | 4305141241405 |
9 | 1053735431364 |
10 | 301344310021 |
11 | 106888009317 |
12 | 4a49b724371 |
13 | 225554ac121 |
14 | 108298b8d6d |
15 | 7c8a702e81 |
hex | 4629854305 |
301344310021 has 2 divisors, whose sum is σ = 301344310022. Its totient is φ = 301344310020.
The previous prime is 301344309997. The next prime is 301344310037. The reversal of 301344310021 is 120013443103.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 164928580996 + 136415729025 = 406114^2 + 369345^2 .
It is a cyclic number.
It is not a de Polignac number, because 301344310021 - 29 = 301344309509 is a prime.
It is a super-2 number, since 2×3013443100212 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 301344309974 and 301344310001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (301344310721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 150672155010 + 150672155011.
It is an arithmetic number, because the mean of its divisors is an integer number (150672155011).
Almost surely, 2301344310021 is an apocalyptic number.
It is an amenable number.
301344310021 is a deficient number, since it is larger than the sum of its proper divisors (1).
301344310021 is an equidigital number, since it uses as much as digits as its factorization.
301344310021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 301344310021 its reverse (120013443103), we get a palindrome (421357753124).
The spelling of 301344310021 in words is "three hundred one billion, three hundred forty-four million, three hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •