Base | Representation |
---|---|
bin | 11101010111101111110… |
… | …11110110111000011111 |
3 | 10120110212121222220112020 |
4 | 32223313323312320133 |
5 | 113013301043322121 |
6 | 2051340052511223 |
7 | 132624320362104 |
oct | 16536773667037 |
9 | 3513777886466 |
10 | 1009182010911 |
11 | 359a9aa32668 |
12 | 14370501b513 |
13 | 7421c6750a9 |
14 | 36bb7abaaab |
15 | 1b3b78e71c6 |
hex | eaf7ef6e1f |
1009182010911 has 8 divisors (see below), whose sum is σ = 1345927080240. Its totient is φ = 672612474432.
The previous prime is 1009182010909. The next prime is 1009182011023. The reversal of 1009182010911 is 1190102819001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1009182010911 - 21 = 1009182010909 is a prime.
It is a super-2 number, since 2×10091820109112 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1009182011911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43869796 + ... + 43892793.
It is an arithmetic number, because the mean of its divisors is an integer number (168240885030).
Almost surely, 21009182010911 is an apocalyptic number.
1009182010911 is a deficient number, since it is larger than the sum of its proper divisors (336745069329).
1009182010911 is an equidigital number, since it uses as much as digits as its factorization.
1009182010911 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87766425.
The product of its (nonzero) digits is 1296, while the sum is 33.
Adding to 1009182010911 its reverse (1190102819001), we get a palindrome (2199284829912).
The spelling of 1009182010911 in words is "one trillion, nine billion, one hundred eighty-two million, ten thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •