Base | Representation |
---|---|
bin | 110010100011100001001110… |
… | …1010111001000110110001001 |
3 | 2011022111121020222202002201122 |
4 | 1211013002131113020312021 |
5 | 431241220143224001423 |
6 | 4213434033335125025 |
7 | 162444346616110532 |
oct | 14507023527106611 |
9 | 2138447228662648 |
10 | 444686374047113 |
11 | 119766483221940 |
12 | 41a5b246b13775 |
13 | 1611898c0c4753 |
14 | 7bb4d1481b689 |
15 | 36624a6a138c8 |
hex | 194709d5c8d89 |
444686374047113 has 16 divisors (see below), whose sum is σ = 496502928854592. Its totient is φ = 394772361984000.
The previous prime is 444686374046963. The next prime is 444686374047169. The reversal of 444686374047113 is 311740473686444.
It is not a de Polignac number, because 444686374047113 - 212 = 444686374043017 is a prime.
It is not an unprimeable number, because it can be changed into a prime (444686374047173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 100905608 + ... + 105220313.
It is an arithmetic number, because the mean of its divisors is an integer number (31031433053412).
Almost surely, 2444686374047113 is an apocalyptic number.
444686374047113 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
It is an amenable number.
444686374047113 is a deficient number, since it is larger than the sum of its proper divisors (51816554807479).
444686374047113 is a wasteful number, since it uses less digits than its factorization.
444686374047113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206130536.
The product of its (nonzero) digits is 130056192, while the sum is 62.
The spelling of 444686374047113 in words is "four hundred forty-four trillion, six hundred eighty-six billion, three hundred seventy-four million, forty-seven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.975 sec. • engine limits •