Base | Representation |
---|---|
bin | 1110111100100000000111… |
… | …0110111010010101001100 |
3 | 2011011221100110220210102220 |
4 | 3233020001312322111030 |
5 | 4123212403431441122 |
6 | 54541004330015340 |
7 | 3314133360522651 |
oct | 357100166722514 |
9 | 64157313823386 |
10 | 16432576046412 |
11 | 526601a866679 |
12 | 1a148b0577550 |
13 | 92277bac5856 |
14 | 40b4ab6d3c28 |
15 | 1d76b064b25c |
hex | ef201dba54c |
16432576046412 has 24 divisors (see below), whose sum is σ = 38343632910576. Its totient is φ = 5477388853248.
The previous prime is 16432576046389. The next prime is 16432576046429. The reversal of 16432576046412 is 21464067523461.
16432576046412 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×164325760464122 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16559733 + ... + 17523980.
It is an arithmetic number, because the mean of its divisors is an integer number (1597651371274).
Almost surely, 216432576046412 is an apocalyptic number.
16432576046412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
16432576046412 is an abundant number, since it is smaller than the sum of its proper divisors (21911056864164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16432576046412 is a wasteful number, since it uses less digits than its factorization.
16432576046412 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34123897 (or 34123895 counting only the distinct ones).
The product of its (nonzero) digits is 5806080, while the sum is 51.
The spelling of 16432576046412 in words is "sixteen trillion, four hundred thirty-two billion, five hundred seventy-six million, forty-six thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •