Base | Representation |
---|---|
bin | 110010000011001100010100… |
… | …0101010111100101110010000 |
3 | 2010201202212012220002112211101 |
4 | 1210012120220222330232100 |
5 | 430200422011022401000 |
6 | 4200153011333154144 |
7 | 161505352232626135 |
oct | 14406305052745620 |
9 | 2121685186075741 |
10 | 440243420122000 |
11 | 11830320559a210 |
12 | 4146215a78b954 |
13 | 15b85a12936861 |
14 | 7a9dc766da58c |
15 | 35d6b1d185e6a |
hex | 1906628abcb90 |
440243420122000 has 80 divisors (see below), whose sum is σ = 1161282098081664. Its totient is φ = 160088516400000.
The previous prime is 440243420121931. The next prime is 440243420122043. The reversal of 440243420122000 is 221024342044.
It is a tau number, because it is divible by the number of its divisors (80).
It is a self number, because there is not a number n which added to its sum of digits gives 440243420122000.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10005510276 + ... + 10005554275.
Almost surely, 2440243420122000 is an apocalyptic number.
440243420122000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
440243420122000 is an abundant number, since it is smaller than the sum of its proper divisors (721038677959664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
440243420122000 is a wasteful number, since it uses less digits than its factorization.
440243420122000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20011064585 (or 20011064569 counting only the distinct ones).
The product of its (nonzero) digits is 12288, while the sum is 28.
Adding to 440243420122000 its reverse (221024342044), we get a palindrome (440464444464044).
The spelling of 440243420122000 in words is "four hundred forty trillion, two hundred forty-three billion, four hundred twenty million, one hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •