Base | Representation |
---|---|
bin | 110110110110101… |
… | …011110110000011 |
3 | 2101010201100011101 |
4 | 312312223312003 |
5 | 3341044230102 |
6 | 231153155231 |
7 | 31543315015 |
oct | 6666536603 |
9 | 2333640141 |
10 | 920305027 |
11 | 432540874 |
12 | 21825bb17 |
13 | 1188858b5 |
14 | 8a3241b5 |
15 | 55bdce87 |
hex | 36dabd83 |
920305027 has 4 divisors (see below), whose sum is σ = 920397456. Its totient is φ = 920212600.
The previous prime is 920305019. The next prime is 920305097. The reversal of 920305027 is 720503029.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 720503029 = 113 ⋅6376133.
It is a cyclic number.
It is not a de Polignac number, because 920305027 - 23 = 920305019 is a prime.
It is a super-2 number, since 2×9203050272 = 1693922685442941458, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 920304986 and 920305004.
It is not an unprimeable number, because it can be changed into a prime (920305007) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29188 + ... + 51889.
It is an arithmetic number, because the mean of its divisors is an integer number (230099364).
Almost surely, 2920305027 is an apocalyptic number.
920305027 is a deficient number, since it is larger than the sum of its proper divisors (92429).
920305027 is a wasteful number, since it uses less digits than its factorization.
920305027 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92428.
The product of its (nonzero) digits is 3780, while the sum is 28.
The square root of 920305027 is about 30336.5295806887. The cubic root of 920305027 is about 972.6963019693.
The spelling of 920305027 in words is "nine hundred twenty million, three hundred five thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •