Base | Representation |
---|---|
bin | 10000111010011100… |
… | …10001101010100111 |
3 | 212102211000202222212 |
4 | 20131032101222213 |
5 | 122044013404411 |
6 | 4101004314035 |
7 | 441005364422 |
oct | 103516215247 |
9 | 25384022885 |
10 | 9080216231 |
11 | 393a5aa939 |
12 | 1914b4291b |
13 | b19287c18 |
14 | 621d369b9 |
15 | 38227468b |
hex | 21d391aa7 |
9080216231 has 16 divisors (see below), whose sum is σ = 9502783488. Its totient is φ = 8666436000.
The previous prime is 9080216221. The next prime is 9080216237. The reversal of 9080216231 is 1326120809.
9080216231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-9080216231 is a prime.
It is a super-2 number, since 2×90802162312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9080216237) by changing a digit.
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, 817940 + ... + 828966.
It is an arithmetic number, because the mean of its divisors is an integer number (593923968).
Almost surely, 29080216231 is an apocalyptic number.
9080216231 is a deficient number, since it is larger than the sum of its proper divisors (422567257).
9080216231 is a wasteful number, since it uses less digits than its factorization.
9080216231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11422.
The product of its (nonzero) digits is 5184, while the sum is 32.
The square root of 9080216231 is about 95290.1685957161. The cubic root of 9080216231 is about 2086.2454230053.
The spelling of 9080216231 in words is "nine billion, eighty million, two hundred sixteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •