Base | Representation |
---|---|
bin | 11110101001100001… |
… | …10000101101011001 |
3 | 1120110201221212122010 |
4 | 33110300300231121 |
5 | 232144320012410 |
6 | 11320432020133 |
7 | 1121520360255 |
oct | 172460605531 |
9 | 46421855563 |
10 | 16454454105 |
11 | 6a84123a01 |
12 | 3232691649 |
13 | 1722c8239b |
14 | b2146d265 |
15 | 664863c20 |
hex | 3d4c30b59 |
16454454105 has 32 divisors (see below), whose sum is σ = 28211670144. Its totient is φ = 8159968256.
The previous prime is 16454454103. The next prime is 16454454161. The reversal of 16454454105 is 50145445461.
16454454105 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 16454454105 - 21 = 16454454103 is a prime.
It is not an unprimeable number, because it can be changed into a prime (16454454103) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 367554 + ... + 409883.
It is an arithmetic number, because the mean of its divisors is an integer number (881614692).
Almost surely, 216454454105 is an apocalyptic number.
16454454105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
16454454105 is a deficient number, since it is larger than the sum of its proper divisors (11757216039).
16454454105 is a wasteful number, since it uses less digits than its factorization.
16454454105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 777545.
The product of its (nonzero) digits is 192000, while the sum is 39.
Adding to 16454454105 its reverse (50145445461), we get a palindrome (66599899566).
The spelling of 16454454105 in words is "sixteen billion, four hundred fifty-four million, four hundred fifty-four thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •