Base | Representation |
---|---|
bin | 100011011000010111111010… |
… | …0001001000111001000110111 |
3 | 1111210220200111012210122011022 |
4 | 1012300233310021013020313 |
5 | 311242403443110030403 |
6 | 3021521201103531355 |
7 | 122360256341245562 |
oct | 10660576411071067 |
9 | 1453820435718138 |
10 | 311213131330103 |
11 | 90186825365262 |
12 | 2aaa3233bb9b5b |
13 | 104863704aca42 |
14 | 56bcb200434d9 |
15 | 25ea57b1d1d38 |
hex | 11b0bf4247237 |
311213131330103 has 16 divisors (see below), whose sum is σ = 329105387439360. Its totient is φ = 293812485657600.
The previous prime is 311213131330093. The next prime is 311213131330111. The reversal of 311213131330103 is 301033131312113.
It is a cyclic number.
It is not a de Polignac number, because 311213131330103 - 224 = 311213114552887 is a prime.
It is a super-2 number, since 2×3112131313301032 (a number of 30 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 (311213131330183) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17086043 + ... + 30238371.
It is an arithmetic number, because the mean of its divisors is an integer number (20569086714960).
Almost surely, 2311213131330103 is an apocalyptic number.
311213131330103 is a deficient number, since it is larger than the sum of its proper divisors (17892256109257).
311213131330103 is a wasteful number, since it uses less digits than its factorization.
311213131330103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13171018.
The product of its (nonzero) digits is 1458, while the sum is 26.
Adding to 311213131330103 its reverse (301033131312113), we get a palindrome (612246262642216).
The spelling of 311213131330103 in words is "three hundred eleven trillion, two hundred thirteen billion, one hundred thirty-one million, three hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •