Base | Representation |
---|---|
bin | 1000011100101001000… |
… | …10001011000100000001 |
3 | 1000202012100121022122221 |
4 | 10032110202023010001 |
5 | 14223420211420014 |
6 | 341201411331041 |
7 | 26653533023104 |
oct | 4162442130401 |
9 | 1022170538587 |
10 | 290254795009 |
11 | 1021072a0583 |
12 | 483058b0a81 |
13 | 214a8b7251a |
14 | 10096b8673b |
15 | 783bd80b24 |
hex | 439488b101 |
290254795009 has 9 divisors (see below), whose sum is σ = 293839242529. Its totient is φ = 286713571540.
The previous prime is 290254795003. The next prime is 290254795049. The reversal of 290254795009 is 900597452092.
The square root of 290254795009 is 538753.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 290254795009 - 215 = 290254762241 is a prime.
It is a super-2 number, since 2×2902547950092 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (290254795003) 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 in 8 ways as a sum of consecutive naturals, for example, 44713254 + ... + 44719744.
Almost surely, 2290254795009 is an apocalyptic number.
290254795009 is the 538753-rd square number.
290254795009 is the 269377-th centered octagonal number.
It is an amenable number.
290254795009 is a deficient number, since it is larger than the sum of its proper divisors (3584447520).
290254795009 is an frugal number, since it uses more digits than its factorization.
290254795009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13148 (or 6574 counting only the distinct ones).
The product of its (nonzero) digits is 2041200, while the sum is 52.
The spelling of 290254795009 in words is "two hundred ninety billion, two hundred fifty-four million, seven hundred ninety-five thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •