Base | Representation |
---|---|
bin | 11101001010011010… |
… | …001010100011001011 |
3 | 2222211021012112022111 |
4 | 131022122022203023 |
5 | 1003112131102021 |
6 | 22215101203151 |
7 | 2155653222022 |
oct | 351232124313 |
9 | 88737175274 |
10 | 31313144011 |
11 | 123094a9616 |
12 | 609a8604b7 |
13 | 2c504529a6 |
14 | 17309cb8b9 |
15 | c340638e1 |
hex | 74a68a8cb |
31313144011 has 4 divisors (see below), whose sum is σ = 31313638512. Its totient is φ = 31312649512.
The previous prime is 31313143951. The next prime is 31313144087. The reversal of 31313144011 is 11044131313.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11044131313 = 61 ⋅181051333.
It is a cyclic number.
It is not a de Polignac number, because 31313144011 - 223 = 31304755403 is a prime.
It is a super-3 number, since 3×313131440113 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31313144711) 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, 135400 + ... + 284533.
It is an arithmetic number, because the mean of its divisors is an integer number (7828409628).
Almost surely, 231313144011 is an apocalyptic number.
31313144011 is a deficient number, since it is larger than the sum of its proper divisors (494501).
31313144011 is an equidigital number, since it uses as much as digits as its factorization.
31313144011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 494500.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 31313144011 its reverse (11044131313), we get a palindrome (42357275324).
The spelling of 31313144011 in words is "thirty-one billion, three hundred thirteen million, one hundred forty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •