Base | Representation |
---|---|
bin | 100000111110010101100101… |
… | …1111101011010000101000011 |
3 | 1102000221210112221012121221011 |
4 | 1001330223023331122011003 |
5 | 301004024132210340311 |
6 | 2504511414131541351 |
7 | 115043612050600201 |
oct | 10174531375320503 |
9 | 1360853487177834 |
10 | 290042563371331 |
11 | 844643a66a1351 |
12 | 2864423775a857 |
13 | c5abb86418924 |
14 | 518a1c6500071 |
15 | 237ea1549a321 |
hex | 107cacbf5a143 |
290042563371331 has 8 divisors (see below), whose sum is σ = 293141513534400. Its totient is φ = 286948068926400.
The previous prime is 290042563371313. The next prime is 290042563371377. The reversal of 290042563371331 is 133173365240092.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 290042563371331 - 213 = 290042563363139 is a prime.
It is a super-4 number, since 4×2900425633713314 (a number of 59 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (290042563371391) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1113798651 + ... + 1114059028.
It is an arithmetic number, because the mean of its divisors is an integer number (36642689191800).
Almost surely, 2290042563371331 is an apocalyptic number.
290042563371331 is a deficient number, since it is larger than the sum of its proper divisors (3098950163069).
290042563371331 is a wasteful number, since it uses less digits than its factorization.
290042563371331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2227859069.
The product of its (nonzero) digits is 2449440, while the sum is 49.
The spelling of 290042563371331 in words is "two hundred ninety trillion, forty-two billion, five hundred sixty-three million, three hundred seventy-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •