Base | Representation |
---|---|
bin | 100011101110010101010110… |
… | …1100111100010011101101111 |
3 | 1112012121012221021200210020102 |
4 | 1013130222231213202131233 |
5 | 312141331210343224403 |
6 | 3032151512050141315 |
7 | 123121314540626426 |
oct | 10734525547423557 |
9 | 1465535837623212 |
10 | 314231310133103 |
11 | 9113a828638770 |
12 | 2b2b0171b8183b |
13 | 10644b682b52bc |
14 | 5784c3b3cc2bd |
15 | 264dd2684cb88 |
hex | 11dcaad9e276f |
314231310133103 has 16 divisors (see below), whose sum is σ = 345960030451200. Its totient is φ = 283029891590880.
The previous prime is 314231310133093. The next prime is 314231310133201. The reversal of 314231310133103 is 301331013132413.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 314231310133103 - 214 = 314231310116719 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (314231316133103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17463158 + ... + 30551996.
It is an arithmetic number, because the mean of its divisors is an integer number (21622501903200).
Almost surely, 2314231310133103 is an apocalyptic number.
314231310133103 is a deficient number, since it is larger than the sum of its proper divisors (31728720318097).
314231310133103 is a wasteful number, since it uses less digits than its factorization.
314231310133103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13108982.
The product of its (nonzero) digits is 5832, while the sum is 29.
Adding to 314231310133103 its reverse (301331013132413), we get a palindrome (615562323265516).
The spelling of 314231310133103 in words is "three hundred fourteen trillion, two hundred thirty-one billion, three hundred ten million, one hundred thirty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •