Base | Representation |
---|---|
bin | 11011000110101000… |
… | …01101010001111001 |
3 | 1101120002112200101102 |
4 | 31203110031101321 |
5 | 214300043043140 |
6 | 10403521301145 |
7 | 1023406452011 |
oct | 154324152171 |
9 | 41502480342 |
10 | 14551143545 |
11 | 6197817574 |
12 | 29a11947b5 |
13 | 14ab85ca13 |
14 | 9c0782c41 |
15 | 5a26eee15 |
hex | 36350d479 |
14551143545 has 8 divisors (see below), whose sum is σ = 18220562496. Its totient is φ = 11134788016.
The previous prime is 14551143511. The next prime is 14551143547. The reversal of 14551143545 is 54534115541.
14551143545 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 a cyclic number.
It is not a de Polignac number, because 14551143545 - 220 = 14550094969 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14551143499 and 14551143508.
It is not an unprimeable number, because it can be changed into a prime (14551143547) 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, 63265727 + ... + 63265956.
It is an arithmetic number, because the mean of its divisors is an integer number (2277570312).
Almost surely, 214551143545 is an apocalyptic number.
It is an amenable number.
14551143545 is a deficient number, since it is larger than the sum of its proper divisors (3669418951).
14551143545 is a wasteful number, since it uses less digits than its factorization.
14551143545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126531711.
The product of its digits is 120000, while the sum is 38.
The spelling of 14551143545 in words is "fourteen billion, five hundred fifty-one million, one hundred forty-three thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •