Base | Representation |
---|---|
bin | 11110010000100101… |
… | …00100110110110101 |
3 | 1112221011020102001111 |
4 | 33020102210312311 |
5 | 231232233332040 |
6 | 11243555155021 |
7 | 1113400021552 |
oct | 171022446665 |
9 | 45834212044 |
10 | 16245214645 |
11 | 6987000230 |
12 | 31945a5a71 |
13 | 16bb81175a |
14 | b01763a29 |
15 | 6512d1dea |
hex | 3c84a4db5 |
16245214645 has 8 divisors (see below), whose sum is σ = 21266462880. Its totient is φ = 11814701520.
The previous prime is 16245214621. The next prime is 16245214649. The reversal of 16245214645 is 54641254261.
16245214645 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 16245214645 - 25 = 16245214613 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16245214598 and 16245214607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16245214649) 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 7 ways as a sum of consecutive naturals, for example, 147683715 + ... + 147683824.
It is an arithmetic number, because the mean of its divisors is an integer number (2658307860).
Almost surely, 216245214645 is an apocalyptic number.
It is an amenable number.
16245214645 is a deficient number, since it is larger than the sum of its proper divisors (5021248235).
16245214645 is a wasteful number, since it uses less digits than its factorization.
16245214645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295367555.
The product of its digits is 230400, while the sum is 40.
The spelling of 16245214645 in words is "sixteen billion, two hundred forty-five million, two hundred fourteen thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •