Base | Representation |
---|---|
bin | 110010010111101010000011… |
… | …1010100010010000111001100 |
3 | 2011002201202010212222100000220 |
4 | 1210233110013110102013030 |
5 | 431033012304403023202 |
6 | 4210145051311151340 |
7 | 162215513203233120 |
oct | 14457240724220714 |
9 | 2132652125870026 |
10 | 443056064111052 |
11 | 119198026819917 |
12 | 41837297515550 |
13 | 1602b01383a102 |
14 | 7b5a056887580 |
15 | 3634d894d2abc |
hex | 192f5075121cc |
443056064111052 has 48 divisors (see below), whose sum is σ = 1181483957052672. Its totient is φ = 126587326950720.
The previous prime is 443056064111039. The next prime is 443056064111077. The reversal of 443056064111052 is 250111460650344.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 443056064110995 and 443056064111013.
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, 125458878 + ... + 128942010.
It is an arithmetic number, because the mean of its divisors is an integer number (24614249105264).
Almost surely, 2443056064111052 is an apocalyptic number.
443056064111052 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
443056064111052 is an abundant number, since it is smaller than the sum of its proper divisors (738427892941620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
443056064111052 is a wasteful number, since it uses less digits than its factorization.
443056064111052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4997438 (or 4997436 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 42.
The spelling of 443056064111052 in words is "four hundred forty-three trillion, fifty-six billion, sixty-four million, one hundred eleven thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •