Base | Representation |
---|---|
bin | 111011100111001… |
… | …010001010110011 |
3 | 2120200220102002221 |
4 | 323213022022303 |
5 | 4022012333021 |
6 | 243124021511 |
7 | 33532613461 |
oct | 7347121263 |
9 | 2520812087 |
10 | 1000121011 |
11 | 4735a679a |
12 | 23ab31897 |
13 | 12c2802a6 |
14 | 96b7d831 |
15 | 5cc07241 |
hex | 3b9ca2b3 |
1000121011 has 4 divisors (see below), whose sum is σ = 1000184472. Its totient is φ = 1000057552.
The previous prime is 1000120997. The next prime is 1000121041. The reversal of 1000121011 is 1101210001.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 1000121011 - 211 = 1000118963 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1000120985 and 1000121003.
It is not an unprimeable number, because it can be changed into a prime (1000121041) 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, 11991 + ... + 46303.
It is an arithmetic number, because the mean of its divisors is an integer number (250046118).
Almost surely, 21000121011 is an apocalyptic number.
1000121011 is a deficient number, since it is larger than the sum of its proper divisors (63461).
1000121011 is an equidigital number, since it uses as much as digits as its factorization.
1000121011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63460.
The product of its (nonzero) digits is 2, while the sum is 7.
The square root of 1000121011 is about 31624.6898957128. The cubic root of 1000121011 is about 1000.0403353730.
Adding to 1000121011 its reverse (1101210001), we get a palindrome (2101331012).
The spelling of 1000121011 in words is "one billion, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •