Base | Representation |
---|---|
bin | 110010011010010000110101… |
… | …0001000101110011001100100 |
3 | 2011010222222120021221112200000 |
4 | 1210310201222020232121210 |
5 | 431104344242300424030 |
6 | 4211021401234421300 |
7 | 162253422225554136 |
oct | 14464415210563144 |
9 | 2133888507845600 |
10 | 443414204311140 |
11 | 1193159a9604a57 |
12 | 41894787a31830 |
13 | 16055a1a9c8c7a |
14 | 7b6d50d47b056 |
15 | 363e34aec7860 |
hex | 193486a22e664 |
443414204311140 has 72 divisors (see below), whose sum is σ = 1394838756292800. Its totient is φ = 118243787815008.
The previous prime is 443414204311139. The next prime is 443414204311151. The reversal of 443414204311140 is 41113402414344.
443414204311140 is a `hidden beast` number, since 4 + 4 + 3 + 41 + 42 + 0 + 431 + 1 + 140 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 443414204311095 and 443414204311104.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 45618740440 + ... + 45618750159.
Almost surely, 2443414204311140 is an apocalyptic number.
It is an amenable number.
443414204311140 is an abundant number, since it is smaller than the sum of its proper divisors (951424551981660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
443414204311140 is a wasteful number, since it uses less digits than its factorization.
443414204311140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91237490623 (or 91237490609 counting only the distinct ones).
The product of its (nonzero) digits is 73728, while the sum is 36.
Adding to 443414204311140 its reverse (41113402414344), we get a palindrome (484527606725484).
The spelling of 443414204311140 in words is "four hundred forty-three trillion, four hundred fourteen billion, two hundred four million, three hundred eleven thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •