Base | Representation |
---|---|
bin | 110101101101100… |
… | …010101001101101 |
3 | 2022210122012011002 |
4 | 311231202221231 |
5 | 3321142141421 |
6 | 225230210045 |
7 | 31221325451 |
oct | 6555425155 |
9 | 2283565132 |
10 | 901130861 |
11 | 422734a54 |
12 | 211953925 |
13 | 114901337 |
14 | 87972661 |
15 | 541a1b0b |
hex | 35b62a6d |
901130861 has 4 divisors (see below), whose sum is σ = 902063712. Its totient is φ = 900198012.
The previous prime is 901130843. The next prime is 901130863. The reversal of 901130861 is 168031109.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 168031109 = 67 ⋅2507927.
It is a cyclic number.
It is not a de Polignac number, because 901130861 - 210 = 901129837 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (901130863) 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 3 ways as a sum of consecutive naturals, for example, 464975 + ... + 466908.
It is an arithmetic number, because the mean of its divisors is an integer number (225515928).
Almost surely, 2901130861 is an apocalyptic number.
It is an amenable number.
901130861 is a deficient number, since it is larger than the sum of its proper divisors (932851).
901130861 is an equidigital number, since it uses as much as digits as its factorization.
901130861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 932850.
The product of its (nonzero) digits is 1296, while the sum is 29.
The square root of 901130861 is about 30018.8417664639. The cubic root of 901130861 is about 965.8935984237.
The spelling of 901130861 in words is "nine hundred one million, one hundred thirty thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •