Base | Representation |
---|---|
bin | 100010100111001000010110… |
… | …0101000000110100111110101 |
3 | 1110220221200022011210001001202 |
4 | 1011032100230220012213311 |
5 | 304401012242343120203 |
6 | 2555300110544502245 |
7 | 121061304061453451 |
oct | 10516205450064765 |
9 | 1426850264701052 |
10 | 304445210520053 |
11 | 89007541517349 |
12 | 2a18b63101a985 |
13 | 100b50a224b4a5 |
14 | 5527326527661 |
15 | 252e4ba387388 |
hex | 114e42ca069f5 |
304445210520053 has 2 divisors, whose sum is σ = 304445210520054. Its totient is φ = 304445210520052.
The previous prime is 304445210520037. The next prime is 304445210520119. The reversal of 304445210520053 is 350025012544403.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 199338056776369 + 105107153743684 = 14118713^2 + 10252178^2 .
It is a cyclic number.
It is not a de Polignac number, because 304445210520053 - 24 = 304445210520037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 304445210519989 and 304445210520016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (304445210550053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 152222605260026 + 152222605260027.
It is an arithmetic number, because the mean of its divisors is an integer number (152222605260027).
Almost surely, 2304445210520053 is an apocalyptic number.
It is an amenable number.
304445210520053 is a deficient number, since it is larger than the sum of its proper divisors (1).
304445210520053 is an equidigital number, since it uses as much as digits as its factorization.
304445210520053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288000, while the sum is 38.
The spelling of 304445210520053 in words is "three hundred four trillion, four hundred forty-five billion, two hundred ten million, five hundred twenty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •