Base | Representation |
---|---|
bin | 100110110010000001100… |
… | …0010111011010001010001 |
3 | 200212112221012212200012211 |
4 | 1031210003002323101101 |
5 | 1144312024002404131 |
6 | 15200341111152121 |
7 | 1060041661216531 |
oct | 115440302732121 |
9 | 20775835780184 |
10 | 5330105513041 |
11 | 1775537674351 |
12 | 721015675641 |
13 | 2c881c0abbca |
14 | 145d9ad5b4c1 |
15 | 939acdec5b1 |
hex | 4d9030bb451 |
5330105513041 has 4 divisors (see below), whose sum is σ = 5513902254900. Its totient is φ = 5146308771184.
The previous prime is 5330105513023. The next prime is 5330105513087. The reversal of 5330105513041 is 1403155010335.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4448893377600 + 881212135441 = 2109240^2 + 938729^2 .
It is a cyclic number.
It is not a de Polignac number, because 5330105513041 - 223 = 5330097124433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5330105512994 and 5330105513012.
It is not an unprimeable number, because it can be changed into a prime (5330105513441) 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, 91898370886 + ... + 91898370943.
It is an arithmetic number, because the mean of its divisors is an integer number (1378475563725).
Almost surely, 25330105513041 is an apocalyptic number.
It is an amenable number.
5330105513041 is a deficient number, since it is larger than the sum of its proper divisors (183796741859).
5330105513041 is a wasteful number, since it uses less digits than its factorization.
5330105513041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 183796741858.
The product of its (nonzero) digits is 13500, while the sum is 31.
The spelling of 5330105513041 in words is "five trillion, three hundred thirty billion, one hundred five million, five hundred thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •