Base | Representation |
---|---|
bin | 100001000000110110111010… |
… | …1000011101000110001001111 |
3 | 1102002011220202112120212021202 |
4 | 1002001231311003220301033 |
5 | 301030213131410100201 |
6 | 2505334510334420115 |
7 | 115110625033245536 |
oct | 10201556503506117 |
9 | 1362156675525252 |
10 | 290388997737551 |
11 | 84588311885219 |
12 | 2869b3bb96163b |
13 | c60574637a57b |
14 | 519cc8c5ab31d |
15 | 2388a3e479c6b |
hex | 1081b750e8c4f |
290388997737551 has 4 divisors (see below), whose sum is σ = 290418309244152. Its totient is φ = 290359686230952.
The previous prime is 290388997737499. The next prime is 290388997737557. The reversal of 290388997737551 is 155737799883092.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 290388997737551 - 210 = 290388997736527 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 290388997737551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (290388997737557) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14655738440 + ... + 14655758253.
It is an arithmetic number, because the mean of its divisors is an integer number (72604577311038).
Almost surely, 2290388997737551 is an apocalyptic number.
290388997737551 is a deficient number, since it is larger than the sum of its proper divisors (29311506601).
290388997737551 is an equidigital number, since it uses as much as digits as its factorization.
290388997737551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29311506600.
The product of its (nonzero) digits is 7201353600, while the sum is 83.
The spelling of 290388997737551 in words is "two hundred ninety trillion, three hundred eighty-eight billion, nine hundred ninety-seven million, seven hundred thirty-seven thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •