Base | Representation |
---|---|
bin | 111100110011011… |
… | …111101010101011 |
3 | 2122002120002001002 |
4 | 330303133222223 |
5 | 4042123211021 |
6 | 245120545215 |
7 | 34164656543 |
oct | 7463375253 |
9 | 2562502032 |
10 | 1020132011 |
11 | 483924308 |
12 | 24578220b |
13 | 133468712 |
14 | 996ac323 |
15 | 5e85b50b |
hex | 3ccdfaab |
1020132011 has 4 divisors (see below), whose sum is σ = 1021393800. Its totient is φ = 1018870224.
The previous prime is 1020131993. The next prime is 1020132023. The reversal of 1020132011 is 1102310201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1102310201 = 5107 ⋅215843.
It is a cyclic number.
It is not a de Polignac number, because 1020132011 - 222 = 1015937707 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020131983 and 1020132001.
It is not an unprimeable number, because it can be changed into a prime (1020132031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 629681 + ... + 631298.
It is an arithmetic number, because the mean of its divisors is an integer number (255348450).
Almost surely, 21020132011 is an apocalyptic number.
1020132011 is a deficient number, since it is larger than the sum of its proper divisors (1261789).
1020132011 is an equidigital number, since it uses as much as digits as its factorization.
1020132011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1261788.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 1020132011 is about 31939.5054908494. The cubic root of 1020132011 is about 1006.6661342458. Note that the first 3 decimals are identical.
Adding to 1020132011 its reverse (1102310201), we get a palindrome (2122442212).
The spelling of 1020132011 in words is "one billion, twenty million, one hundred thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •