Base | Representation |
---|---|
bin | 1000110010100001011… |
… | …00000100110111000001 |
3 | 1001212111222222211100112 |
4 | 10121100230010313001 |
5 | 14421444332122431 |
6 | 350423151001105 |
7 | 30550606622042 |
oct | 4312054046701 |
9 | 1055458884315 |
10 | 302001442241 |
11 | 107094a394a4 |
12 | 4a643809195 |
13 | 2262b68c565 |
14 | 1088cc948c9 |
15 | 7cc8258c2b |
hex | 4650b04dc1 |
302001442241 has 2 divisors, whose sum is σ = 302001442242. Its totient is φ = 302001442240.
The previous prime is 302001442181. The next prime is 302001442243. The reversal of 302001442241 is 142244100203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 254011968016 + 47989474225 = 503996^2 + 219065^2 .
It is a cyclic number.
It is not a de Polignac number, because 302001442241 - 214 = 302001425857 is a prime.
It is a super-3 number, since 3×3020014422413 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 302001442243, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (302001442243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 151000721120 + 151000721121.
It is an arithmetic number, because the mean of its divisors is an integer number (151000721121).
Almost surely, 2302001442241 is an apocalyptic number.
It is an amenable number.
302001442241 is a deficient number, since it is larger than the sum of its proper divisors (1).
302001442241 is an equidigital number, since it uses as much as digits as its factorization.
302001442241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 302001442241 its reverse (142244100203), we get a palindrome (444245542444).
The spelling of 302001442241 in words is "three hundred two billion, one million, four hundred forty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •