Base | Representation |
---|---|
bin | 1000110010100011111… |
… | …10010110011100000101 |
3 | 1001212120111120120211101 |
4 | 10121101332112130011 |
5 | 14422020342310203 |
6 | 350425241140101 |
7 | 30551261141002 |
oct | 4312176263405 |
9 | 1055514516741 |
10 | 302023010053 |
11 | 1070a612a736 |
12 | 4a64aa8a631 |
13 | 22632ca148b |
14 | 10891aaa8a9 |
15 | 7cca0b941d |
hex | 4651f96705 |
302023010053 has 2 divisors, whose sum is σ = 302023010054. Its totient is φ = 302023010052.
The previous prime is 302023009993. The next prime is 302023010057. The reversal of 302023010053 is 350010320203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 267146327044 + 34876683009 = 516862^2 + 186753^2 .
It is a cyclic number.
It is not a de Polignac number, because 302023010053 - 233 = 293433075461 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 302023010053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (302023010057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 151011505026 + 151011505027.
It is an arithmetic number, because the mean of its divisors is an integer number (151011505027).
Almost surely, 2302023010053 is an apocalyptic number.
It is an amenable number.
302023010053 is a deficient number, since it is larger than the sum of its proper divisors (1).
302023010053 is an equidigital number, since it uses as much as digits as its factorization.
302023010053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 19.
Adding to 302023010053 its reverse (350010320203), we get a palindrome (652033330256).
The spelling of 302023010053 in words is "three hundred two billion, twenty-three million, ten thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •