Base | Representation |
---|---|
bin | 1000011100010111001… |
… | …01100110110001100000 |
3 | 1000201210220011201000112 |
4 | 10032023211212301200 |
5 | 14223113300400000 |
6 | 341134450310452 |
7 | 26650031156243 |
oct | 4161345466140 |
9 | 1021726151015 |
10 | 290104700000 |
11 | 10203a5a3a15 |
12 | 48283588428 |
13 | 21483a3c2cb |
14 | 10080c7525a |
15 | 782dad3235 |
hex | 438b966c60 |
290104700000 has 72 divisors (see below), whose sum is σ = 713884089744. Its totient is φ = 116041840000.
The previous prime is 290104699957. The next prime is 290104700027. The reversal of 290104700000 is 7401092.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1350524 + ... + 1550523.
It is an arithmetic number, because the mean of its divisors is an integer number (9915056802).
Almost surely, 2290104700000 is an apocalyptic number.
290104700000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
290104700000 is an abundant number, since it is smaller than the sum of its proper divisors (423779389744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
290104700000 is an frugal number, since it uses more digits than its factorization.
290104700000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2901082 (or 2901054 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 23.
The spelling of 290104700000 in words is "two hundred ninety billion, one hundred four million, seven hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •