Base | Representation |
---|---|
bin | 1110000110100000101011… |
… | …10100101011111111000111 |
3 | 11001210112022022100111111112 |
4 | 13003100111310223333013 |
5 | 13031032020140312221 |
6 | 145541451111355235 |
7 | 6350254311000632 |
oct | 703202564537707 |
9 | 131715268314445 |
10 | 31010030010311 |
11 | 9976309569170 |
12 | 3589b50382b1b |
13 | 143c3056a1b21 |
14 | 792c71928c19 |
15 | 38b996d7a15b |
hex | 1c3415d2bfc7 |
31010030010311 has 4 divisors (see below), whose sum is σ = 33829123647624. Its totient is φ = 28190936373000.
The previous prime is 31010030010287. The next prime is 31010030010361. The reversal of 31010030010311 is 11301003001013.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31010030010311 is a prime.
It is a super-2 number, since 2×310100300103112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31010030010361) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1409546818640 + ... + 1409546818661.
It is an arithmetic number, because the mean of its divisors is an integer number (8457280911906).
Almost surely, 231010030010311 is an apocalyptic number.
31010030010311 is a deficient number, since it is larger than the sum of its proper divisors (2819093637313).
31010030010311 is a wasteful number, since it uses less digits than its factorization.
31010030010311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2819093637312.
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 31010030010311 its reverse (11301003001013), we get a palindrome (42311033011324).
The spelling of 31010030010311 in words is "thirty-one trillion, ten billion, thirty million, ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •