Base | Representation |
---|---|
bin | 1001001001000011110… |
… | …00101110011011111001 |
3 | 1010000202020200200222021 |
4 | 10210201320232123321 |
5 | 20121234342143001 |
6 | 400143541154441 |
7 | 31456501363420 |
oct | 4444170563371 |
9 | 1100666620867 |
10 | 314101131001 |
11 | 111233999779 |
12 | 50a5b9bba21 |
13 | 23809388cc8 |
14 | 112b9c222b7 |
15 | 828561bba1 |
hex | 4921e2e6f9 |
314101131001 has 8 divisors (see below), whose sum is σ = 359366770944. Its totient is φ = 268934003520.
The previous prime is 314101130971. The next prime is 314101131031. The reversal of 314101131001 is 100131101413.
It is an interprime number because it is at equal distance from previous prime (314101130971) and next prime (314101131031).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 314101131001 - 229 = 313564260089 is a prime.
It is a super-2 number, since 2×3141011310012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (314101131031) 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, 24621280 + ... + 24634033.
It is an arithmetic number, because the mean of its divisors is an integer number (44920846368).
Almost surely, 2314101131001 is an apocalyptic number.
It is an amenable number.
314101131001 is a deficient number, since it is larger than the sum of its proper divisors (45265639943).
314101131001 is an equidigital number, since it uses as much as digits as its factorization.
314101131001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49256231.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 314101131001 its reverse (100131101413), we get a palindrome (414232232414).
The spelling of 314101131001 in words is "three hundred fourteen billion, one hundred one million, one hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •