Base | Representation |
---|---|
bin | 10101000110100110110… |
… | …001101011101010111101 |
3 | 12010122020001221200011222 |
4 | 111012212301223222331 |
5 | 142230003204124131 |
6 | 3030114050123125 |
7 | 206526233533661 |
oct | 25064661535275 |
9 | 5118201850158 |
10 | 1450202020541 |
11 | 50a03326336a |
12 | 1b50858804a5 |
13 | a69a448a781 |
14 | 50293ac68a1 |
15 | 27aca60c87b |
hex | 151a6c6babd |
1450202020541 has 8 divisors (see below), whose sum is σ = 1480366666368. Its totient is φ = 1420307910000.
The previous prime is 1450202020529. The next prime is 1450202020573.
1450202020541 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1450202020541 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1450202020541.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1450202020441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 67622990 + ... + 67644431.
It is an arithmetic number, because the mean of its divisors is an integer number (185045833296).
Almost surely, 21450202020541 is an apocalyptic number.
It is an amenable number.
1450202020541 is a deficient number, since it is larger than the sum of its proper divisors (30164645827).
1450202020541 is a wasteful number, since it uses less digits than its factorization.
1450202020541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135267643.
The product of its (nonzero) digits is 3200, while the sum is 26.
The spelling of 1450202020541 in words is "one trillion, four hundred fifty billion, two hundred two million, twenty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •