Base | Representation |
---|---|
bin | 1000101000000110010… |
… | …00110000101001100001 |
3 | 1001100001222222222102211 |
4 | 10110003020300221201 |
5 | 14324014233341424 |
6 | 344100003442121 |
7 | 30262126042003 |
oct | 4240310605141 |
9 | 1040058888384 |
10 | 296405371489 |
11 | 104783117737 |
12 | 49541686341 |
13 | 21c491ac6a6 |
14 | 104bb990373 |
15 | 7a9bd0db94 |
hex | 4503230a61 |
296405371489 has 2 divisors, whose sum is σ = 296405371490. Its totient is φ = 296405371488.
The previous prime is 296405371477. The next prime is 296405371637. The reversal of 296405371489 is 984173504692.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 273780097600 + 22625273889 = 523240^2 + 150417^2 .
It is a cyclic number.
It is not a de Polignac number, because 296405371489 - 211 = 296405369441 is a prime.
It is a super-2 number, since 2×2964053714892 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (296405371429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 148202685744 + 148202685745.
It is an arithmetic number, because the mean of its divisors is an integer number (148202685745).
It is a 1-persistent number, because it is pandigital, but 2⋅296405371489 = 592810742978 is not.
Almost surely, 2296405371489 is an apocalyptic number.
It is an amenable number.
296405371489 is a deficient number, since it is larger than the sum of its proper divisors (1).
296405371489 is an equidigital number, since it uses as much as digits as its factorization.
296405371489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13063680, while the sum is 58.
The spelling of 296405371489 in words is "two hundred ninety-six billion, four hundred five million, three hundred seventy-one thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •