Base | Representation |
---|---|
bin | 11101110101101101001… |
… | …110111010000000011001 |
3 | 21021000210002202122210022 |
4 | 131311231032322000121 |
5 | 232043442144234340 |
6 | 4210000145400225 |
7 | 301101044424140 |
oct | 35655516720031 |
9 | 7230702678708 |
10 | 2050532024345 |
11 | 720697963682 |
12 | 2914a7039075 |
13 | 11b4975bc6ac |
14 | 71363b10757 |
15 | 385144143b5 |
hex | 1dd6d3ba019 |
2050532024345 has 8 divisors (see below), whose sum is σ = 2812158204864. Its totient is φ = 1406079102384.
The previous prime is 2050532024293. The next prime is 2050532024353. The reversal of 2050532024345 is 5434202350502.
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 2050532024345 - 212 = 2050532020249 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (35), and also a Moran number because the ratio is a prime number: 58586629267 = 2050532024345 / (2 + 0 + 5 + 0 + 5 + 3 + 2 + 0 + 2 + 4 + 3 + 4 + 5).
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29293314599 + ... + 29293314668.
It is an arithmetic number, because the mean of its divisors is an integer number (351519775608).
Almost surely, 22050532024345 is an apocalyptic number.
It is an amenable number.
2050532024345 is a deficient number, since it is larger than the sum of its proper divisors (761626180519).
2050532024345 is an equidigital number, since it uses as much as digits as its factorization.
2050532024345 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58586629279.
The product of its (nonzero) digits is 144000, while the sum is 35.
Adding to 2050532024345 its reverse (5434202350502), we get a palindrome (7484734374847).
The spelling of 2050532024345 in words is "two trillion, fifty billion, five hundred thirty-two million, twenty-four thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •