Base | Representation |
---|---|
bin | 10001010100001… |
… | …111110000100000 |
3 | 202020122221122120 |
4 | 101110033300200 |
5 | 1043333120341 |
6 | 44454504240 |
7 | 10125244236 |
oct | 2124176040 |
9 | 666587576 |
10 | 290520096 |
11 | 139a9a059 |
12 | 81365080 |
13 | 4825bba9 |
14 | 2a826956 |
15 | 1a78a066 |
hex | 1150fc20 |
290520096 has 96 divisors (see below), whose sum is σ = 806754816. Its totient is φ = 91392000.
The previous prime is 290520091. The next prime is 290520133. The reversal of 290520096 is 690025092.
It is a tau number, because it is divible by the number of its divisors (96).
It is not an unprimeable number, because it can be changed into a prime (290520091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 120826 + ... + 123206.
It is an arithmetic number, because the mean of its divisors is an integer number (8403696).
Almost surely, 2290520096 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 290520096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (403377408).
290520096 is an abundant number, since it is smaller than the sum of its proper divisors (516234720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
290520096 is a wasteful number, since it uses less digits than its factorization.
290520096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2466 (or 2458 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 33.
The square root of 290520096 is about 17044.6500697433. The cubic root of 290520096 is about 662.3060562471.
The spelling of 290520096 in words is "two hundred ninety million, five hundred twenty thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •