Base | Representation |
---|---|
bin | 111100110011010… |
… | …110110110001001 |
3 | 2122002111020110221 |
4 | 330303112312021 |
5 | 4042121032011 |
6 | 245120110041 |
7 | 34164446320 |
oct | 7463266611 |
9 | 2562436427 |
10 | 1020095881 |
11 | 4838aa152 |
12 | 245765321 |
13 | 13345513c |
14 | 9969d0b7 |
15 | 5e850971 |
hex | 3ccd6d89 |
1020095881 has 4 divisors (see below), whose sum is σ = 1165823872. Its totient is φ = 874367892.
The previous prime is 1020095831. The next prime is 1020095887. The reversal of 1020095881 is 1885900201.
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.
It is a cyclic number.
It is not a de Polignac number, because 1020095881 - 27 = 1020095753 is a prime.
It is a super-2 number, since 2×10200958812 = 2081191212866332322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1020095887) 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, 72863985 + ... + 72863998.
It is an arithmetic number, because the mean of its divisors is an integer number (291455968).
Almost surely, 21020095881 is an apocalyptic number.
It is an amenable number.
1020095881 is a deficient number, since it is larger than the sum of its proper divisors (145727991).
1020095881 is an equidigital number, since it uses as much as digits as its factorization.
1020095881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145727990.
The product of its (nonzero) digits is 5760, while the sum is 34.
The square root of 1020095881 is about 31938.9398853500. The cubic root of 1020095881 is about 1006.6542497457.
The spelling of 1020095881 in words is "one billion, twenty million, ninety-five thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •