Base | Representation |
---|---|
bin | 110110110101100… |
… | …101000100100101 |
3 | 2101010011121111212 |
4 | 312311211010211 |
5 | 3341010441031 |
6 | 231143041205 |
7 | 31540666613 |
oct | 6665450445 |
9 | 2333147455 |
10 | 920015141 |
11 | 432362aa1 |
12 | 218140205 |
13 | 1187b3976 |
14 | 8a28a6b3 |
15 | 55b8212b |
hex | 36d65125 |
920015141 has 2 divisors, whose sum is σ = 920015142. Its totient is φ = 920015140.
The previous prime is 920015137. The next prime is 920015147. The reversal of 920015141 is 141510029.
It is a happy number.
920015141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 911436100 + 8579041 = 30190^2 + 2929^2 .
It is a cyclic number.
It is not a de Polignac number, because 920015141 - 22 = 920015137 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (920015147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 460007570 + 460007571.
It is an arithmetic number, because the mean of its divisors is an integer number (460007571).
Almost surely, 2920015141 is an apocalyptic number.
It is an amenable number.
920015141 is a deficient number, since it is larger than the sum of its proper divisors (1).
920015141 is an equidigital number, since it uses as much as digits as its factorization.
920015141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 23.
The square root of 920015141 is about 30331.7513671730. The cubic root of 920015141 is about 972.5941616850.
The spelling of 920015141 in words is "nine hundred twenty million, fifteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •