Base | Representation |
---|---|
bin | 1010110011011… |
… | …10100100001110 |
3 | 20022112111120000 |
4 | 11121232210032 |
5 | 141200133124 |
6 | 12554305130 |
7 | 2150226420 |
oct | 531564416 |
9 | 208474500 |
10 | 90630414 |
11 | 47181a76 |
12 | 264281a6 |
13 | 15a12b84 |
14 | c072810 |
15 | 7e536c9 |
hex | 566e90e |
90630414 has 80 divisors (see below), whose sum is σ = 233772000. Its totient is φ = 25707456.
The previous prime is 90630413. The next prime is 90630457. The reversal of 90630414 is 41403609.
It is a super-2 number, since 2×906304142 = 16427743883622792, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (90630413) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 259512 + ... + 259860.
It is an arithmetic number, because the mean of its divisors is an integer number (2922150).
Almost surely, 290630414 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 90630414, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (116886000).
90630414 is an abundant number, since it is smaller than the sum of its proper divisors (143141586).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
90630414 is a wasteful number, since it uses less digits than its factorization.
90630414 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 599 (or 590 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The square root of 90630414 is about 9520.0007352941. Note that the first 3 decimals coincide. The cubic root of 90630414 is about 449.1843892913.
The spelling of 90630414 in words is "ninety million, six hundred thirty thousand, four hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •