Base | Representation |
---|---|
bin | 101011110100001111011… |
… | …000010111101101110011 |
3 | 101122211222212101111101101 |
4 | 223310033120113231303 |
5 | 343313042202340311 |
6 | 10223125333145231 |
7 | 430353063512161 |
oct | 53641730275563 |
9 | 11584885344341 |
10 | 3011030121331 |
11 | a60a75008131 |
12 | 407683a8b217 |
13 | 18ac28a7280b |
14 | a5a3dba8231 |
15 | 534ccc82ec1 |
hex | 2bd0f617b73 |
3011030121331 has 2 divisors, whose sum is σ = 3011030121332. Its totient is φ = 3011030121330.
The previous prime is 3011030121313. The next prime is 3011030121377. The reversal of 3011030121331 is 1331210301103.
Together with previous prime (3011030121313) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3011030121331 - 235 = 2976670382963 is a prime.
It is a super-2 number, since 2×30110301213312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3011030121299 and 3011030121308.
It is not a weakly prime, because it can be changed into another prime (3011030121301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1505515060665 + 1505515060666.
It is an arithmetic number, because the mean of its divisors is an integer number (1505515060666).
Almost surely, 23011030121331 is an apocalyptic number.
3011030121331 is a deficient number, since it is larger than the sum of its proper divisors (1).
3011030121331 is an equidigital number, since it uses as much as digits as its factorization.
3011030121331 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 19.
Adding to 3011030121331 its reverse (1331210301103), we get a palindrome (4342240422434).
The spelling of 3011030121331 in words is "three trillion, eleven billion, thirty million, one hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •