Base | Representation |
---|---|
bin | 111100010000111… |
… | …011101110010101 |
3 | 2121110111202220011 |
4 | 330100323232111 |
5 | 4032313300033 |
6 | 244154440221 |
7 | 34024653316 |
oct | 7420735625 |
9 | 2543452804 |
10 | 1011071893 |
11 | 4797a6307 |
12 | 242733071 |
13 | 1316158c0 |
14 | 983d060d |
15 | 5db6bccd |
hex | 3c43bb95 |
1011071893 has 6 divisors (see below), whose sum is σ = 1088970134. Its totient is φ = 933191304.
The previous prime is 1011071843. The next prime is 1011071899. The reversal of 1011071893 is 3981701101.
It can be written as a sum of positive squares in only one way, i.e., 699972849 + 311099044 = 26457^2 + 17638^2 .
It is a de Polignac number, because none of the positive numbers 2k-1011071893 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 (1011071899) 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 5 ways as a sum of consecutive naturals, for example, 110238 + ... + 119056.
Almost surely, 21011071893 is an apocalyptic number.
1011071893 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1011071893 is a deficient number, since it is larger than the sum of its proper divisors (77898241).
1011071893 is an frugal number, since it uses more digits than its factorization.
1011071893 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17651 (or 8832 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 31.
The square root of 1011071893 is about 31797.3566983169. The cubic root of 1011071893 is about 1003.6770934114.
Adding to 1011071893 its reverse (3981701101), we get a palindrome (4992772994).
The spelling of 1011071893 in words is "one billion, eleven million, seventy-one thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •