Base | Representation |
---|---|
bin | 1110110110000100011000… |
… | …0001001110001011010111 |
3 | 2010210101001202111202112001 |
4 | 3231201012001032023113 |
5 | 4114410024403401020 |
6 | 54414125122540131 |
7 | 3303141424460563 |
oct | 355410601161327 |
9 | 63711052452461 |
10 | 16322050450135 |
11 | 5223162a67281 |
12 | 19b73a5807647 |
13 | 915216751141 |
14 | 405dc47b46a3 |
15 | 1d489233150a |
hex | ed84604e2d7 |
16322050450135 has 16 divisors (see below), whose sum is σ = 19596416522112. Its totient is φ = 13051004148000.
The previous prime is 16322050450133. The next prime is 16322050450141. The reversal of 16322050450135 is 53105405022361.
It is not a de Polignac number, because 16322050450135 - 21 = 16322050450133 is a prime.
It is a super-2 number, since 2×163220504501352 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16322050450094 and 16322050450103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16322050450133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 129837060 + ... + 129962710.
It is an arithmetic number, because the mean of its divisors is an integer number (1224776032632).
Almost surely, 216322050450135 is an apocalyptic number.
16322050450135 is a deficient number, since it is larger than the sum of its proper divisors (3274366071977).
16322050450135 is a wasteful number, since it uses less digits than its factorization.
16322050450135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138654.
The product of its (nonzero) digits is 108000, while the sum is 37.
Adding to 16322050450135 its reverse (53105405022361), we get a palindrome (69427455472496).
The spelling of 16322050450135 in words is "sixteen trillion, three hundred twenty-two billion, fifty million, four hundred fifty thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.724 sec. • engine limits •