Base | Representation |
---|---|
bin | 100010100101011111100111… |
… | …1000110000101100100111101 |
3 | 1110220011011202222122101010011 |
4 | 1011022333033012011210331 |
5 | 304333321140033204042 |
6 | 2555004513340343221 |
7 | 121036122465332266 |
oct | 10512771706054475 |
9 | 1426134688571104 |
10 | 304220303022397 |
11 | 88a3011905a543 |
12 | 2a153b23b44b11 |
13 | 10099b0b912a28 |
14 | 551a4ac49b96d |
15 | 2528705413a17 |
hex | 114afcf18593d |
304220303022397 has 2 divisors, whose sum is σ = 304220303022398. Its totient is φ = 304220303022396.
The previous prime is 304220303022379. The next prime is 304220303022413. The reversal of 304220303022397 is 793220303022403.
Together with previous prime (304220303022379) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 176266673690116 + 127953629332281 = 13276546^2 + 11311659^2 .
It is a cyclic number.
It is not a de Polignac number, because 304220303022397 - 27 = 304220303022269 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (304220303022997) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 152110151511198 + 152110151511199.
It is an arithmetic number, because the mean of its divisors is an integer number (152110151511199).
Almost surely, 2304220303022397 is an apocalyptic number.
It is an amenable number.
304220303022397 is a deficient number, since it is larger than the sum of its proper divisors (1).
304220303022397 is an equidigital number, since it uses as much as digits as its factorization.
304220303022397 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 326592, while the sum is 40.
The spelling of 304220303022397 in words is "three hundred four trillion, two hundred twenty billion, three hundred three million, twenty-two thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •