Base | Representation |
---|---|
bin | 1001001010101010111… |
… | …11111111111100000001 |
3 | 1010002222121002200011201 |
4 | 10211111133333330001 |
5 | 20130023032024241 |
6 | 400405513141201 |
7 | 31520114605360 |
oct | 4452537777401 |
9 | 1102877080151 |
10 | 314967064321 |
11 | 111638773248 |
12 | 510619ba801 |
13 | 239168b56a0 |
14 | 1135cc317d7 |
15 | 82d6669931 |
hex | 49557fff01 |
314967064321 has 32 divisors (see below), whose sum is σ = 395123097600. Its totient is φ = 244421029440.
The previous prime is 314967064303. The next prime is 314967064327. The reversal of 314967064321 is 123460769413.
It is not a de Polignac number, because 314967064321 - 27 = 314967064193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (314967064327) 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 in 31 ways as a sum of consecutive naturals, for example, 2290176 + ... + 2423806.
It is an arithmetic number, because the mean of its divisors is an integer number (12347596800).
Almost surely, 2314967064321 is an apocalyptic number.
It is an amenable number.
314967064321 is a deficient number, since it is larger than the sum of its proper divisors (80156033279).
314967064321 is a wasteful number, since it uses less digits than its factorization.
314967064321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134149.
The product of its (nonzero) digits is 653184, while the sum is 46.
The spelling of 314967064321 in words is "three hundred fourteen billion, nine hundred sixty-seven million, sixty-four thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •