Base | Representation |
---|---|
bin | 100000000001100001011… |
… | …0111101110010000001101 |
3 | 120120202120021100122011001 |
4 | 1000003002313232100031 |
5 | 1034102343332222011 |
6 | 13205534150300301 |
7 | 632661465601423 |
oct | 100030267562015 |
9 | 16522507318131 |
10 | 4401315898381 |
11 | 144765109a996 |
12 | 5b1007957691 |
13 | 25c071c4a26c |
14 | 11304c1a1113 |
15 | 7974d1847c1 |
hex | 400c2dee40d |
4401315898381 has 2 divisors, whose sum is σ = 4401315898382. Its totient is φ = 4401315898380.
The previous prime is 4401315898361. The next prime is 4401315898409. The reversal of 4401315898381 is 1838985131044.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3355707395881 + 1045608502500 = 1831859^2 + 1022550^2 .
It is a cyclic number.
It is not a de Polignac number, because 4401315898381 - 215 = 4401315865613 is a prime.
It is a super-2 number, since 2×44013158983812 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4401315898361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2200657949190 + 2200657949191.
It is an arithmetic number, because the mean of its divisors is an integer number (2200657949191).
Almost surely, 24401315898381 is an apocalyptic number.
It is an amenable number.
4401315898381 is a deficient number, since it is larger than the sum of its proper divisors (1).
4401315898381 is an equidigital number, since it uses as much as digits as its factorization.
4401315898381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3317760, while the sum is 55.
The spelling of 4401315898381 in words is "four trillion, four hundred one billion, three hundred fifteen million, eight hundred ninety-eight thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •