Base | Representation |
---|---|
bin | 1010110100010… |
… | …00000000000000 |
3 | 20022201210110110 |
4 | 11122020000000 |
5 | 141212001332 |
6 | 13000431320 |
7 | 2151142224 |
oct | 532100000 |
9 | 208653413 |
10 | 90734592 |
11 | 47243273 |
12 | 26478540 |
13 | 15a4b410 |
14 | c09c784 |
15 | 7e744cc |
hex | 5688000 |
90734592 has 128 divisors (see below), whose sum is σ = 264237120. Its totient is φ = 27525120.
The previous prime is 90734531. The next prime is 90734597. The reversal of 90734592 is 29543709.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a nialpdrome in base 8.
It is a self number, because there is not a number n which added to its sum of digits gives 90734592.
It is not an unprimeable number, because it can be changed into a prime (90734597) 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, 1277917 + ... + 1277987.
Almost surely, 290734592 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 90734592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (132118560).
90734592 is an abundant number, since it is smaller than the sum of its proper divisors (173502528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
90734592 is an equidigital number, since it uses as much as digits as its factorization.
90734592 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117 (or 89 counting only the distinct ones).
The product of its (nonzero) digits is 68040, while the sum is 39.
The square root of 90734592 is about 9525.4706970312. The cubic root of 90734592 is about 449.3564331289.
The spelling of 90734592 in words is "ninety million, seven hundred thirty-four thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •