Base | Representation |
---|---|
bin | 100000000001100001011… |
… | …1011101110010000001101 |
3 | 120120202120100022220112012 |
4 | 1000003002323232100031 |
5 | 1034102344114300312 |
6 | 13205534224551005 |
7 | 632661510526460 |
oct | 100030273562015 |
9 | 16522510286465 |
10 | 4401316946957 |
11 | 1447651746787 |
12 | 5b1008182465 |
13 | 25c072226618 |
14 | 11304c3952d7 |
15 | 7974d2e0322 |
hex | 400c2eee40d |
4401316946957 has 8 divisors (see below), whose sum is σ = 5030089280832. Its totient is φ = 3772547805600.
The previous prime is 4401316946951. The next prime is 4401316946969. The reversal of 4401316946957 is 7596496131044.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4401316946957 - 220 = 4401315898381 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4401316946896 and 4401316946905.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4401316946951) 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 in 7 ways as a sum of consecutive naturals, for example, 4506782 + ... + 5395712.
It is an arithmetic number, because the mean of its divisors is an integer number (628761160104).
Almost surely, 24401316946957 is an apocalyptic number.
It is an amenable number.
4401316946957 is a deficient number, since it is larger than the sum of its proper divisors (628772333875).
4401316946957 is an equidigital number, since it uses as much as digits as its factorization.
4401316946957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1596259.
The product of its (nonzero) digits is 19595520, while the sum is 59.
The spelling of 4401316946957 in words is "four trillion, four hundred one billion, three hundred sixteen million, nine hundred forty-six thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •