Base | Representation |
---|---|
bin | 1001011011110001010… |
… | …1110001010010100000 |
3 | 120111100012002121220220 |
4 | 2112330111301102200 |
5 | 10123411321112342 |
6 | 202242224003040 |
7 | 14465222661351 |
oct | 2267425612240 |
9 | 514305077826 |
10 | 162073613472 |
11 | 6280a369701 |
12 | 274b2160480 |
13 | 1238ba49444 |
14 | 7bb7091d28 |
15 | 4338a415ec |
hex | 25bc5714a0 |
162073613472 has 24 divisors (see below), whose sum is σ = 425443235616. Its totient is φ = 54024537792.
The previous prime is 162073613467. The next prime is 162073613489. The reversal of 162073613472 is 274316370261.
162073613472 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (24).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 844133308 + ... + 844133499.
It is an arithmetic number, because the mean of its divisors is an integer number (17726801484).
Almost surely, 2162073613472 is an apocalyptic number.
162073613472 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
162073613472 is an abundant number, since it is smaller than the sum of its proper divisors (263369622144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
162073613472 is a wasteful number, since it uses less digits than its factorization.
162073613472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1688266820 (or 1688266812 counting only the distinct ones).
The product of its (nonzero) digits is 254016, while the sum is 42.
The spelling of 162073613472 in words is "one hundred sixty-two billion, seventy-three million, six hundred thirteen thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •