Base | Representation |
---|---|
bin | 1010110110011… |
… | …00100000100001 |
3 | 20100021001101101 |
4 | 11123030200201 |
5 | 141244441301 |
6 | 13010434401 |
7 | 2153421304 |
oct | 533144041 |
9 | 210231341 |
10 | 91015201 |
11 | 47415082 |
12 | 26592a01 |
13 | 15b19064 |
14 | c132b3b |
15 | 7ecc701 |
hex | 56cc821 |
91015201 has 4 divisors (see below), whose sum is σ = 91070532. Its totient is φ = 90959872.
The previous prime is 91015193. The next prime is 91015207. The reversal of 91015201 is 10251019.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10251019 = 1237 ⋅8287.
It can be written as a sum of positive squares in 2 ways, for example, as 54774801 + 36240400 = 7401^2 + 6020^2 .
It is a cyclic number.
It is not a de Polignac number, because 91015201 - 23 = 91015193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (91015207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25120 + ... + 28513.
It is an arithmetic number, because the mean of its divisors is an integer number (22767633).
Almost surely, 291015201 is an apocalyptic number.
It is an amenable number.
91015201 is a deficient number, since it is larger than the sum of its proper divisors (55331).
91015201 is a wasteful number, since it uses less digits than its factorization.
91015201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55330.
The product of its (nonzero) digits is 90, while the sum is 19.
The square root of 91015201 is about 9540.1887297894. The cubic root of 91015201 is about 449.8191882642.
The spelling of 91015201 in words is "ninety-one million, fifteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •