Base | Representation |
---|---|
bin | 100011101101110110010010… |
… | …1110001001110010111111101 |
3 | 1112012100211202120222011202102 |
4 | 1013123230211301032113331 |
5 | 312134233103223231222 |
6 | 3032101121111034445 |
7 | 123113433551030444 |
oct | 10733544561162775 |
9 | 1465324676864672 |
10 | 314164606461437 |
11 | 91114509102996 |
12 | 2b29b25706ba25 |
13 | 1063b797a659b4 |
14 | 57819104b7d5b |
15 | 264c220816d92 |
hex | 11dbb25c4e5fd |
314164606461437 has 2 divisors, whose sum is σ = 314164606461438. Its totient is φ = 314164606461436.
The previous prime is 314164606461413. The next prime is 314164606461463. The reversal of 314164606461437 is 734164606461413.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 295138862315236 + 19025744146201 = 17179606^2 + 4361851^2 .
It is a cyclic number.
It is not a de Polignac number, because 314164606461437 - 234 = 314147426592253 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (314164606481437) 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 as a sum of consecutive naturals, namely, 157082303230718 + 157082303230719.
It is an arithmetic number, because the mean of its divisors is an integer number (157082303230719).
Almost surely, 2314164606461437 is an apocalyptic number.
It is an amenable number.
314164606461437 is a deficient number, since it is larger than the sum of its proper divisors (1).
314164606461437 is an equidigital number, since it uses as much as digits as its factorization.
314164606461437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20901888, while the sum is 56.
The spelling of 314164606461437 in words is "three hundred fourteen trillion, one hundred sixty-four billion, six hundred six million, four hundred sixty-one thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •