Base | Representation |
---|---|
bin | 1001001001011011100… |
… | …01111000010011110111 |
3 | 1010001021011010222110110 |
4 | 10210231301320103313 |
5 | 20122141432204111 |
6 | 400215425554103 |
7 | 31464443361435 |
oct | 4445561702367 |
9 | 1101234128413 |
10 | 314300663031 |
11 | 111326592083 |
12 | 50ab67a5933 |
13 | 2383b80b2b4 |
14 | 112d8521d55 |
15 | 8297dd25a6 |
hex | 492dc784f7 |
314300663031 has 4 divisors (see below), whose sum is σ = 419067550712. Its totient is φ = 209533775352.
The previous prime is 314300662969. The next prime is 314300663051. The reversal of 314300663031 is 130366003413.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 314300663031 - 27 = 314300662903 is a prime.
It is a super-2 number, since 2×3143006630312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 314300663031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (314300663051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52383443836 + ... + 52383443841.
It is an arithmetic number, because the mean of its divisors is an integer number (104766887678).
Almost surely, 2314300663031 is an apocalyptic number.
314300663031 is a deficient number, since it is larger than the sum of its proper divisors (104766887681).
314300663031 is a wasteful number, since it uses less digits than its factorization.
314300663031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104766887680.
The product of its (nonzero) digits is 11664, while the sum is 30.
Adding to 314300663031 its reverse (130366003413), we get a palindrome (444666666444).
The spelling of 314300663031 in words is "three hundred fourteen billion, three hundred million, six hundred sixty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.152 sec. • engine limits •