Base | Representation |
---|---|
bin | 1000011100011010111… |
… | …11000110000101100000 |
3 | 1000201220010002201211020 |
4 | 10032031133012011200 |
5 | 14223144424011210 |
6 | 341141545045440 |
7 | 26650565651520 |
oct | 4161537060540 |
9 | 1021803081736 |
10 | 290136547680 |
11 | 102056576611 |
12 | 48292186880 |
13 | 2148a5102a5 |
14 | 100851a5680 |
15 | 78317c4770 |
hex | 438d7c6160 |
290136547680 has 96 divisors (see below), whose sum is σ = 1044491583744. Its totient is φ = 66316924416.
The previous prime is 290136547637. The next prime is 290136547697. The reversal of 290136547680 is 86745631092.
It is a tau number, because it is divible by the number of its divisors (96).
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 15 ways as a sum of consecutive naturals, for example, 43171722 + ... + 43178441.
It is an arithmetic number, because the mean of its divisors is an integer number (10880120664).
It is a 1-persistent number, because it is pandigital, but 2⋅290136547680 = 580273095360 is not.
Almost surely, 2290136547680 is an apocalyptic number.
290136547680 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
290136547680 is an abundant number, since it is smaller than the sum of its proper divisors (754355036064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
290136547680 is a wasteful number, since it uses less digits than its factorization.
290136547680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86350188 (or 86350180 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 51.
The spelling of 290136547680 in words is "two hundred ninety billion, one hundred thirty-six million, five hundred forty-seven thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •