Base | Representation |
---|---|
bin | 100100011001110110010… |
… | …0011111101101100001001 |
3 | 122201022102022221100012201 |
4 | 1020303230203331230021 |
5 | 1123433240030030431 |
6 | 14350253402040201 |
7 | 1024322463645331 |
oct | 110635443755411 |
9 | 18638368840181 |
10 | 5003310783241 |
11 | 165998a556a61 |
12 | 6898127a9061 |
13 | 2a3a6bc807c4 |
14 | 13423936c0c1 |
15 | 8a233204461 |
hex | 48cec8fdb09 |
5003310783241 has 8 divisors (see below), whose sum is σ = 5051946446144. Its totient is φ = 4954676271120.
The previous prime is 5003310783217. The next prime is 5003310783257. The reversal of 5003310783241 is 1423870133005.
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 5003310783241 - 27 = 5003310783113 is a prime.
It is a super-3 number, since 3×50033107832413 (a number of 39 digits) contains 333 as substring.
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 5003310783241.
It is not an unprimeable number, because it can be changed into a prime (5003310780241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10353295 + ... + 10825771.
It is an arithmetic number, because the mean of its divisors is an integer number (631493305768).
Almost surely, 25003310783241 is an apocalyptic number.
It is an amenable number.
5003310783241 is a deficient number, since it is larger than the sum of its proper divisors (48635662903).
5003310783241 is a wasteful number, since it uses less digits than its factorization.
5003310783241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 575391.
The product of its (nonzero) digits is 60480, while the sum is 37.
The spelling of 5003310783241 in words is "five trillion, three billion, three hundred ten million, seven hundred eighty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •