Base | Representation |
---|---|
bin | 10010001100100111111010… |
… | …100111111000011010011100 |
3 | 101111101000102201011202022120 |
4 | 102030213322213320122130 |
5 | 40442222203034310202 |
6 | 442114202304542540 |
7 | 22600100516631603 |
oct | 2214477247703234 |
9 | 344330381152276 |
10 | 80032330385052 |
11 | 23556580077a31 |
12 | 8b86975621a50 |
13 | 3587029c7a786 |
14 | 15a982a6daa3a |
15 | 93bc57e370bc |
hex | 48c9fa9f869c |
80032330385052 has 96 divisors (see below), whose sum is σ = 192237113800704. Its totient is φ = 25898939136000.
The previous prime is 80032330384969. The next prime is 80032330385081. The reversal of 80032330385052 is 25058303323008.
It is a super-2 number, since 2×800323303850522 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 80032330384995 and 80032330385013.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 257348052 + ... + 257658852.
It is an arithmetic number, because the mean of its divisors is an integer number (2002469935424).
Almost surely, 280032330385052 is an apocalyptic number.
80032330385052 is a gapful number since it is divisible by the number (82) formed by its first and last digit.
It is an amenable number.
80032330385052 is an abundant number, since it is smaller than the sum of its proper divisors (112204783415652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80032330385052 is a wasteful number, since it uses less digits than its factorization.
80032330385052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313419 (or 313417 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 42.
The spelling of 80032330385052 in words is "eighty trillion, thirty-two billion, three hundred thirty million, three hundred eighty-five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •