Base | Representation |
---|---|
bin | 111001001100010001001000… |
… | …1100010001100100110110110 |
3 | 2102222012101111021202200201010 |
4 | 1302120202101202030212312 |
5 | 1011414142241000403432 |
6 | 4541532042224013050 |
7 | 210651062205635145 |
oct | 16230422142144666 |
9 | 2388171437680633 |
10 | 503063371106742 |
11 | 136322a83177a36 |
12 | 48509075161186 |
13 | 1879189819b594 |
14 | 8c3257b81175c |
15 | 3d25c757e13cc |
hex | 1c9889188c9b6 |
503063371106742 has 8 divisors (see below), whose sum is σ = 1006126742213496. Its totient is φ = 167687790368912.
The previous prime is 503063371106719. The next prime is 503063371106749. The reversal of 503063371106742 is 247601173360305.
It is a sphenic number, since it is the product of 3 distinct primes.
503063371106742 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 503063371106691 and 503063371106700.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (503063371106749) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41921947592223 + ... + 41921947592234.
It is an arithmetic number, because the mean of its divisors is an integer number (125765842776687).
Almost surely, 2503063371106742 is an apocalyptic number.
503063371106742 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
503063371106742 is a wasteful number, since it uses less digits than its factorization.
503063371106742 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83843895184462.
The product of its (nonzero) digits is 1905120, while the sum is 48.
The spelling of 503063371106742 in words is "five hundred three trillion, sixty-three billion, three hundred seventy-one million, one hundred six thousand, seven hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.153 sec. • engine limits •