Base | Representation |
---|---|
bin | 1110001010011000100010… |
… | …11110011000111010000111 |
3 | 11002021020210020222100001021 |
4 | 13011030101132120322013 |
5 | 13040222032331323221 |
6 | 150122535413412011 |
7 | 6363005035053226 |
oct | 705142136307207 |
9 | 132236706870037 |
10 | 31143101042311 |
11 | 9a17795704075 |
12 | 35ab8a963a007 |
13 | 144ba2189b34b |
14 | 799496c0acbd |
15 | 390184614041 |
hex | 1c5311798e87 |
31143101042311 has 8 divisors (see below), whose sum is σ = 31808947400640. Its totient is φ = 30477389150208.
The previous prime is 31143101042303. The next prime is 31143101042323. The reversal of 31143101042311 is 11324010134113.
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 31143101042311 - 23 = 31143101042303 is a prime.
It is a super-2 number, since 2×311431010423112 (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 (31143101042371) 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, 33148326 + ... + 34074883.
It is an arithmetic number, because the mean of its divisors is an integer number (3976118425080).
Almost surely, 231143101042311 is an apocalyptic number.
31143101042311 is a deficient number, since it is larger than the sum of its proper divisors (665846358329).
31143101042311 is an equidigital number, since it uses as much as digits as its factorization.
31143101042311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67233113.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 31143101042311 its reverse (11324010134113), we get a palindrome (42467111176424).
The spelling of 31143101042311 in words is "thirty-one trillion, one hundred forty-three billion, one hundred one million, forty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •