Base | Representation |
---|---|
bin | 101101100000101010110000… |
… | …1000000001010001011010101 |
3 | 1221111101122112201202021202122 |
4 | 1123001111201000022023111 |
5 | 404432221140342132232 |
6 | 3535221423203345325 |
7 | 150214510306023206 |
oct | 13301254100121325 |
9 | 1844348481667678 |
10 | 400314054255317 |
11 | 106609267508a34 |
12 | 38a93666982245 |
13 | 1424a5b7ca3767 |
14 | 70bd4371475ad |
15 | 314314958b312 |
hex | 16c156100a2d5 |
400314054255317 has 2 divisors, whose sum is σ = 400314054255318. Its totient is φ = 400314054255316.
The previous prime is 400314054255307. The next prime is 400314054255337. The reversal of 400314054255317 is 713552450413004.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 307938235252561 + 92375819002756 = 17548169^2 + 9611234^2 .
It is a cyclic number.
It is not a de Polignac number, because 400314054255317 - 26 = 400314054255253 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (400314054255307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 200157027127658 + 200157027127659.
It is an arithmetic number, because the mean of its divisors is an integer number (200157027127659).
Almost surely, 2400314054255317 is an apocalyptic number.
It is an amenable number.
400314054255317 is a deficient number, since it is larger than the sum of its proper divisors (1).
400314054255317 is an equidigital number, since it uses as much as digits as its factorization.
400314054255317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008000, while the sum is 44.
The spelling of 400314054255317 in words is "four hundred trillion, three hundred fourteen billion, fifty-four million, two hundred fifty-five thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •