Base | Representation |
---|---|
bin | 101011110100001110110… |
… | …101100100110111000011 |
3 | 101122211222020020002110011 |
4 | 223310032311210313003 |
5 | 343313032334001011 |
6 | 10223124405445351 |
7 | 430352623132564 |
oct | 53641665446703 |
9 | 11584866202404 |
10 | 3011021000131 |
11 | a60a6a948251 |
12 | 407680a10857 |
13 | 18ac26bcac61 |
14 | a5a3c8b216b |
15 | 534cc080621 |
hex | 2bd0ed64dc3 |
3011021000131 has 2 divisors, whose sum is σ = 3011021000132. Its totient is φ = 3011021000130.
The previous prime is 3011021000107. The next prime is 3011021000191. The reversal of 3011021000131 is 1310001201103.
3011021000131 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3011021000131 - 219 = 3011020475843 is a prime.
It is a super-2 number, since 2×30110210001312 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3011021000191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1505510500065 + 1505510500066.
It is an arithmetic number, because the mean of its divisors is an integer number (1505510500066).
Almost surely, 23011021000131 is an apocalyptic number.
3011021000131 is a deficient number, since it is larger than the sum of its proper divisors (1).
3011021000131 is an equidigital number, since it uses as much as digits as its factorization.
3011021000131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 3011021000131 its reverse (1310001201103), we get a palindrome (4321022201234).
The spelling of 3011021000131 in words is "three trillion, eleven billion, twenty-one million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •