Base | Representation |
---|---|
bin | 100110101101110011011… |
… | …1100000001000010110001 |
3 | 200211200112201001101002102 |
4 | 1031123212330001002301 |
5 | 1144134444231130131 |
6 | 15152242011430145 |
7 | 1056301300531052 |
oct | 115334674010261 |
9 | 20750481041072 |
10 | 5321044005041 |
11 | 1771707692266 |
12 | 71b306a55355 |
13 | 2c7a0697445b |
14 | 14577b6d4729 |
15 | 9362c6211cb |
hex | 4d6e6f010b1 |
5321044005041 has 4 divisors (see below), whose sum is σ = 5321361449712. Its totient is φ = 5320726560372.
The previous prime is 5321044004999. The next prime is 5321044005107. The reversal of 5321044005041 is 1405004401235.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5321044005041 - 242 = 922997493937 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5321044004995 and 5321044005013.
It is not an unprimeable number, because it can be changed into a prime (5321044008041) 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, 158697191 + ... + 158730716.
It is an arithmetic number, because the mean of its divisors is an integer number (1330340362428).
Almost surely, 25321044005041 is an apocalyptic number.
It is an amenable number.
5321044005041 is a deficient number, since it is larger than the sum of its proper divisors (317444671).
5321044005041 is a wasteful number, since it uses less digits than its factorization.
5321044005041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 317444670.
The product of its (nonzero) digits is 9600, while the sum is 29.
Adding to 5321044005041 its reverse (1405004401235), we get a palindrome (6726048406276).
The spelling of 5321044005041 in words is "five trillion, three hundred twenty-one billion, forty-four million, five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •