Base | Representation |
---|---|
bin | 11100111000011001… |
… | …100101101010000011 |
3 | 2222001012200011210002 |
4 | 130320121211222003 |
5 | 1002002304044021 |
6 | 22125105230215 |
7 | 2145324114332 |
oct | 347031455203 |
9 | 88035604702 |
10 | 31011003011 |
11 | 121739a260a |
12 | 601563236b |
13 | 2c02985531 |
14 | 170281bd19 |
15 | c1778050b |
hex | 738665a83 |
31011003011 has 4 divisors (see below), whose sum is σ = 31013713224. Its totient is φ = 31008292800.
The previous prime is 31011002993. The next prime is 31011003019. The reversal of 31011003011 is 11030011013.
It is a happy number.
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 31011003011 - 26 = 31011002947 is a prime.
It is a super-2 number, since 2×310110030112 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31011002983 and 31011003001.
It is not an unprimeable number, because it can be changed into a prime (31011003019) 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, 1337870 + ... + 1360851.
It is an arithmetic number, because the mean of its divisors is an integer number (7753428306).
Almost surely, 231011003011 is an apocalyptic number.
31011003011 is a deficient number, since it is larger than the sum of its proper divisors (2710213).
31011003011 is a wasteful number, since it uses less digits than its factorization.
31011003011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2710212.
The product of its (nonzero) digits is 9, while the sum is 11.
Adding to 31011003011 its reverse (11030011013), we get a palindrome (42041014024).
The spelling of 31011003011 in words is "thirty-one billion, eleven million, three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •