Base | Representation |
---|---|
bin | 1110101011000001101101… |
… | …0000101010010001010010 |
3 | 2010010020102112010212011120 |
4 | 3222300123100222101102 |
5 | 4103303030224003200 |
6 | 54151033520423110 |
7 | 3253344532601223 |
oct | 352603320522122 |
9 | 63106375125146 |
10 | 16132354516050 |
11 | 515a769611333 |
12 | 1986684a77a96 |
13 | 900375111ab6 |
14 | 3dab4ada724a |
15 | 1ce98d7cd9a0 |
hex | eac1b42a452 |
16132354516050 has 24 divisors (see below), whose sum is σ = 40008239200176. Its totient is φ = 4301961204240.
The previous prime is 16132354516027. The next prime is 16132354516123. The reversal of 16132354516050 is 5061545323161.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 16132354515993 and 16132354516011.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 53774514904 + ... + 53774515203.
It is an arithmetic number, because the mean of its divisors is an integer number (1667009966674).
Almost surely, 216132354516050 is an apocalyptic number.
16132354516050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16132354516050 is an abundant number, since it is smaller than the sum of its proper divisors (23875884684126).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16132354516050 is a wasteful number, since it uses less digits than its factorization.
16132354516050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107549030122 (or 107549030117 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 42.
The spelling of 16132354516050 in words is "sixteen trillion, one hundred thirty-two billion, three hundred fifty-four million, five hundred sixteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •