Base | Representation |
---|---|
bin | 11100110111110011… |
… | …110110100111100011 |
3 | 2222000112001121111201 |
4 | 130313303312213203 |
5 | 1001442241023021 |
6 | 22124113222031 |
7 | 2145144044563 |
oct | 346763664743 |
9 | 88015047451 |
10 | 31001111011 |
11 | 12169356602 |
12 | 6012261917 |
13 | 2c00900b90 |
14 | 17013a4da3 |
15 | c16979591 |
hex | 737cf69e3 |
31001111011 has 4 divisors (see below), whose sum is σ = 33385811872. Its totient is φ = 28616410152.
The previous prime is 31001110997. The next prime is 31001111023. The reversal of 31001111011 is 11011110013.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 31001111011 - 27 = 31001110883 is a prime.
It is a super-2 number, since 2×310011110112 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31001111111) 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 in 3 ways as a sum of consecutive naturals, for example, 1192350411 + ... + 1192350436.
It is an arithmetic number, because the mean of its divisors is an integer number (8346452968).
Almost surely, 231001111011 is an apocalyptic number.
31001111011 is a deficient number, since it is larger than the sum of its proper divisors (2384700861).
31001111011 is a wasteful number, since it uses less digits than its factorization.
31001111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2384700860.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 31001111011 its reverse (11011110013), we get a palindrome (42012221024).
It can be divided in two parts, 3100 and 1111011, that added together give a palindrome (1114111).
The spelling of 31001111011 in words is "thirty-one billion, one million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •