Base | Representation |
---|---|
bin | 100100101001001100011… |
… | …0010011001110011100001 |
3 | 122211110110222011001102211 |
4 | 1021102120302121303201 |
5 | 1130003232321130031 |
6 | 14413343405442121 |
7 | 1026600225231241 |
oct | 111223062316341 |
9 | 18743428131384 |
10 | 5036265020641 |
11 | 16719603442a8 |
12 | 69408ab70341 |
13 | 2a6bc13c666a |
14 | 135a83ca9b21 |
15 | 8b011382bb1 |
hex | 49498c99ce1 |
5036265020641 has 8 divisors (see below), whose sum is σ = 5043441275840. Its totient is φ = 5029091332272.
The previous prime is 5036265020617. The next prime is 5036265020681. The reversal of 5036265020641 is 1460205626305.
It is a happy number.
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 5036265020641 - 211 = 5036265018593 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5036265020594 and 5036265020603.
It is not an unprimeable number, because it can be changed into a prime (5036265020681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3302446 + ... + 4580248.
It is an arithmetic number, because the mean of its divisors is an integer number (630430159480).
Almost surely, 25036265020641 is an apocalyptic number.
It is an amenable number.
5036265020641 is a deficient number, since it is larger than the sum of its proper divisors (7176255199).
5036265020641 is a wasteful number, since it uses less digits than its factorization.
5036265020641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1283415.
The product of its (nonzero) digits is 259200, while the sum is 40.
The spelling of 5036265020641 in words is "five trillion, thirty-six billion, two hundred sixty-five million, twenty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •