Base | Representation |
---|---|
bin | 100000000001100001011… |
… | …1011101110010000011001 |
3 | 120120202120100022220112122 |
4 | 1000003002323232100121 |
5 | 1034102344114300334 |
6 | 13205534224551025 |
7 | 632661510526505 |
oct | 100030273562031 |
9 | 16522510286478 |
10 | 4401316946969 |
11 | 1447651746798 |
12 | 5b1008182475 |
13 | 25c072226627 |
14 | 11304c395305 |
15 | 7974d2e032e |
hex | 400c2eee419 |
4401316946969 has 2 divisors, whose sum is σ = 4401316946970. Its totient is φ = 4401316946968.
The previous prime is 4401316946951. The next prime is 4401316946981. The reversal of 4401316946969 is 9696496131044.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3064992506944 + 1336324440025 = 1750712^2 + 1155995^2 .
It is a cyclic number.
It is not a de Polignac number, because 4401316946969 - 232 = 4397021979673 is a prime.
It is a super-2 number, since 2×44013169469692 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4401316942969) 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, 2200658473484 + 2200658473485.
It is an arithmetic number, because the mean of its divisors is an integer number (2200658473485).
Almost surely, 24401316946969 is an apocalyptic number.
It is an amenable number.
4401316946969 is a deficient number, since it is larger than the sum of its proper divisors (1).
4401316946969 is an equidigital number, since it uses as much as digits as its factorization.
4401316946969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30233088, while the sum is 62.
The spelling of 4401316946969 in words is "four trillion, four hundred one billion, three hundred sixteen million, nine hundred forty-six thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •