Base | Representation |
---|---|
bin | 101011110100010101011… |
… | …001001111010000100101 |
3 | 101122212020220020021112202 |
4 | 223310111121033100211 |
5 | 343313244014342013 |
6 | 10223143335424245 |
7 | 430355430204356 |
oct | 53642531172045 |
9 | 11585226207482 |
10 | 3011131012133 |
11 | a61016a57962 |
12 | 4076b1825085 |
13 | 18ac4393890a |
14 | a5a4d34bd2d |
15 | 534d6a61858 |
hex | 2bd1564f425 |
3011131012133 has 2 divisors, whose sum is σ = 3011131012134. Its totient is φ = 3011131012132.
The previous prime is 3011131012079. The next prime is 3011131012151. The reversal of 3011131012133 is 3312101311103.
3011131012133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2527915563364 + 483215448769 = 1589942^2 + 695137^2 .
It is a cyclic number.
It is not a de Polignac number, because 3011131012133 - 26 = 3011131012069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3011131012733) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1505565506066 + 1505565506067.
It is an arithmetic number, because the mean of its divisors is an integer number (1505565506067).
Almost surely, 23011131012133 is an apocalyptic number.
It is an amenable number.
3011131012133 is a deficient number, since it is larger than the sum of its proper divisors (1).
3011131012133 is an equidigital number, since it uses as much as digits as its factorization.
3011131012133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 3011131012133 its reverse (3312101311103), we get a palindrome (6323232323236).
The spelling of 3011131012133 in words is "three trillion, eleven billion, one hundred thirty-one million, twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •