Base | Representation |
---|---|
bin | 1100111011100101001… |
… | …10001000011010011010 |
3 | 1120110211022210110002210 |
4 | 12131302212020122122 |
5 | 24234413340330132 |
6 | 540035513335550 |
7 | 44046162433311 |
oct | 6356246103232 |
9 | 1513738713083 |
10 | 444304230042 |
11 | 161479178152 |
12 | 721387075b6 |
13 | 32b8936158a |
14 | 1770c279278 |
15 | b8561ecbcc |
hex | 677298869a |
444304230042 has 8 divisors (see below), whose sum is σ = 888608460096. Its totient is φ = 148101410012.
The previous prime is 444304230011. The next prime is 444304230049. The reversal of 444304230042 is 240032403444.
It is a sphenic number, since it is the product of 3 distinct primes.
444304230042 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 444304229991 and 444304230009.
It is not an unprimeable number, because it can be changed into a prime (444304230049) 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 in 3 ways as a sum of consecutive naturals, for example, 37025352498 + ... + 37025352509.
It is an arithmetic number, because the mean of its divisors is an integer number (111076057512).
Almost surely, 2444304230042 is an apocalyptic number.
444304230042 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
444304230042 is a wasteful number, since it uses less digits than its factorization.
444304230042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74050705012.
The product of its (nonzero) digits is 36864, while the sum is 30.
Adding to 444304230042 its reverse (240032403444), we get a palindrome (684336633486).
The spelling of 444304230042 in words is "four hundred forty-four billion, three hundred four million, two hundred thirty thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •