Base | Representation |
---|---|
bin | 11101010010001000001… |
… | …110001000100100100111 |
3 | 21010101011202002212210122 |
4 | 131102020032020210213 |
5 | 230432223001213111 |
6 | 4140241321512155 |
7 | 265246262430335 |
oct | 35221016104447 |
9 | 7111152085718 |
10 | 2012330101031 |
11 | 706473976228 |
12 | 28600534265b |
13 | 1179b9c05943 |
14 | 6d57c278b55 |
15 | 3752a705cdb |
hex | 1d488388927 |
2012330101031 has 4 divisors (see below), whose sum is σ = 2081720794200. Its totient is φ = 1942939407864.
The previous prime is 2012330100983. The next prime is 2012330101121. The reversal of 2012330101031 is 1301010332102.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 2012330101031 - 26 = 2012330100967 is a prime.
It is a super-2 number, since 2×20123301010312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012330101931) 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, 34695346541 + ... + 34695346598.
It is an arithmetic number, because the mean of its divisors is an integer number (520430198550).
Almost surely, 22012330101031 is an apocalyptic number.
2012330101031 is a deficient number, since it is larger than the sum of its proper divisors (69390693169).
2012330101031 is an equidigital number, since it uses as much as digits as its factorization.
2012330101031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69390693168.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 2012330101031 its reverse (1301010332102), we get a palindrome (3313340433133).
The spelling of 2012330101031 in words is "two trillion, twelve billion, three hundred thirty million, one hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •