Base | Representation |
---|---|
bin | 10001010010010100… |
… | …10001011000111001 |
3 | 212221202212220020011 |
4 | 20221022101120321 |
5 | 123001301234423 |
6 | 4132521101521 |
7 | 445656614143 |
oct | 105112213071 |
9 | 25852786204 |
10 | 9280493113 |
11 | 3a32661921 |
12 | 19700278a1 |
13 | b4b90b258 |
14 | 64078bc93 |
15 | 394b35b0d |
hex | 229291639 |
9280493113 has 2 divisors, whose sum is σ = 9280493114. Its totient is φ = 9280493112.
The previous prime is 9280493107. The next prime is 9280493119. The reversal of 9280493113 is 3113940829.
It is a balanced prime because it is at equal distance from previous prime (9280493107) and next prime (9280493119).
It can be written as a sum of positive squares in only one way, i.e., 9280046889 + 446224 = 96333^2 + 668^2 .
It is an emirp because it is prime and its reverse (3113940829) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 9280493113 - 25 = 9280493081 is a prime.
It is a super-2 number, since 2×92804931132 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (9280493119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4640246556 + 4640246557.
It is an arithmetic number, because the mean of its divisors is an integer number (4640246557).
Almost surely, 29280493113 is an apocalyptic number.
It is an amenable number.
9280493113 is a deficient number, since it is larger than the sum of its proper divisors (1).
9280493113 is an equidigital number, since it uses as much as digits as its factorization.
9280493113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 46656, while the sum is 40.
The square root of 9280493113 is about 96335.3160216958. The cubic root of 9280493113 is about 2101.4723697815.
The spelling of 9280493113 in words is "nine billion, two hundred eighty million, four hundred ninety-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •