Base | Representation |
---|---|
bin | 100111000011110101101… |
… | …1001110001110010100011 |
3 | 201000012200111010121212222 |
4 | 1032013223121301302203 |
5 | 1200423402032243003 |
6 | 15230105301541255 |
7 | 1062565024216430 |
oct | 116075331616243 |
9 | 21005614117788 |
10 | 5368363556003 |
11 | 178a78a302278 |
12 | 72851211482b |
13 | 2cc3082b4656 |
14 | 147b8a040b87 |
15 | 9499b9e3c38 |
hex | 4e1eb671ca3 |
5368363556003 has 8 divisors (see below), whose sum is σ = 6301090815072. Its totient is φ = 4477090841856.
The previous prime is 5368363555979. The next prime is 5368363556041. The reversal of 5368363556003 is 3006553638635.
5368363556003 is digitally balanced in base 3, 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 5368363556003 - 210 = 5368363554979 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5368363556063) 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, 10363635950 + ... + 10363636467.
It is an arithmetic number, because the mean of its divisors is an integer number (787636351884).
Almost surely, 25368363556003 is an apocalyptic number.
5368363556003 is a deficient number, since it is larger than the sum of its proper divisors (932727259069).
5368363556003 is a wasteful number, since it uses less digits than its factorization.
5368363556003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20727272461.
The product of its (nonzero) digits is 17496000, while the sum is 53.
The spelling of 5368363556003 in words is "five trillion, three hundred sixty-eight billion, three hundred sixty-three million, five hundred fifty-six thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •