Base | Representation |
---|---|
bin | 100011100110001011010111… |
… | …0000100101010000011010111 |
3 | 1112001122001111100020222112221 |
4 | 1013030112232010222003113 |
5 | 312014444424303131403 |
6 | 3025532522255323211 |
7 | 122644321620032326 |
oct | 10714265604520327 |
9 | 1461561440228487 |
10 | 313110331302103 |
11 | 90848389283515 |
12 | 2b14aa68520507 |
13 | 105932400c777a |
14 | 5746899a420bd |
15 | 262eab9231dbd |
hex | 11cc5ae12a0d7 |
313110331302103 has 2 divisors, whose sum is σ = 313110331302104. Its totient is φ = 313110331302102.
The previous prime is 313110331302011. The next prime is 313110331302133. The reversal of 313110331302103 is 301203133011313.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 313110331302103 - 229 = 313109794431191 is a prime.
It is a super-2 number, since 2×3131103313021032 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313110331302133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156555165651051 + 156555165651052.
It is an arithmetic number, because the mean of its divisors is an integer number (156555165651052).
Almost surely, 2313110331302103 is an apocalyptic number.
313110331302103 is a deficient number, since it is larger than the sum of its proper divisors (1).
313110331302103 is an equidigital number, since it uses as much as digits as its factorization.
313110331302103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 313110331302103 its reverse (301203133011313), we get a palindrome (614313464313416).
The spelling of 313110331302103 in words is "three hundred thirteen trillion, one hundred ten billion, three hundred thirty-one million, three hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •