Base | Representation |
---|---|
bin | 1110000110010000011100… |
… | …01000110011111001111111 |
3 | 11001202200210200020122202011 |
4 | 13003020032020303321333 |
5 | 13030411141122231221 |
6 | 145533450011512051 |
7 | 6346525250525311 |
oct | 703101610637177 |
9 | 131680720218664 |
10 | 31001311133311 |
11 | 9972644a288a2 |
12 | 3588318458627 |
13 | 143b5462403cc |
14 | 7926859b17b1 |
15 | 38b6366ce1e1 |
hex | 1c320e233e7f |
31001311133311 has 8 divisors (see below), whose sum is σ = 31174933520880. Its totient is φ = 30827693531712.
The previous prime is 31001311133291. The next prime is 31001311133341. The reversal of 31001311133311 is 11333111310013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 31001311133311 - 225 = 31001277578879 is a prime.
It is a super-2 number, since 2×310013111333112 (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 (31001311133341) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12214581 + ... + 14532673.
It is an arithmetic number, because the mean of its divisors is an integer number (3896866690110).
Almost surely, 231001311133311 is an apocalyptic number.
31001311133311 is a deficient number, since it is larger than the sum of its proper divisors (173622387569).
31001311133311 is a wasteful number, since it uses less digits than its factorization.
31001311133311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2392985.
The product of its (nonzero) digits is 243, while the sum is 22.
Adding to 31001311133311 its reverse (11333111310013), we get a palindrome (42334422443324).
The spelling of 31001311133311 in words is "thirty-one trillion, one billion, three hundred eleven million, one hundred thirty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •