Base | Representation |
---|---|
bin | 1101001110111011110001… |
… | …1010111111110100110011 |
3 | 1220111222122112022120121212 |
4 | 3103232330122333310303 |
5 | 3401342320122102311 |
6 | 50540135433110335 |
7 | 3031134621324035 |
oct | 323567432776463 |
9 | 56458575276555 |
10 | 14550215425331 |
11 | 46aa7913143a3 |
12 | 176bb198583ab |
13 | 817105669b41 |
14 | 38433c85bc55 |
15 | 1a374027ac8b |
hex | d3bbc6bfd33 |
14550215425331 has 4 divisors (see below), whose sum is σ = 14647867878000. Its totient is φ = 14452562972664.
The previous prime is 14550215425301. The next prime is 14550215425433. The reversal of 14550215425331 is 13352451205541.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14550215425331 is a prime.
It is a super-2 number, since 2×145502154253312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14550215425301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 48826226111 + ... + 48826226408.
It is an arithmetic number, because the mean of its divisors is an integer number (3661966969500).
Almost surely, 214550215425331 is an apocalyptic number.
14550215425331 is a deficient number, since it is larger than the sum of its proper divisors (97652452669).
14550215425331 is an equidigital number, since it uses as much as digits as its factorization.
14550215425331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97652452668.
The product of its (nonzero) digits is 360000, while the sum is 41.
The spelling of 14550215425331 in words is "fourteen trillion, five hundred fifty billion, two hundred fifteen million, four hundred twenty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •