Base | Representation |
---|---|
bin | 1010010111000011… |
… | …10111011010110001 |
3 | 112100122010210111222 |
4 | 11023201313122301 |
5 | 42342401324431 |
6 | 2315531514425 |
7 | 254556243434 |
oct | 51341673261 |
9 | 15318123458 |
10 | 5562136241 |
11 | 23a4754312 |
12 | 10b28b8a15 |
13 | 6a845b09c |
14 | 3aa9cd81b |
15 | 22849557b |
hex | 14b8776b1 |
5562136241 has 4 divisors (see below), whose sum is σ = 5583285312. Its totient is φ = 5540987172.
The previous prime is 5562136213. The next prime is 5562136249. The reversal of 5562136241 is 1426312655.
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 a de Polignac number, because none of the positive numbers 2k-5562136241 is a prime.
It is a super-2 number, since 2×55621362412 = 61874719126891220162, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5562136249) 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, 10574141 + ... + 10574666.
It is an arithmetic number, because the mean of its divisors is an integer number (1395821328).
Almost surely, 25562136241 is an apocalyptic number.
It is an amenable number.
5562136241 is a deficient number, since it is larger than the sum of its proper divisors (21149071).
5562136241 is a wasteful number, since it uses less digits than its factorization.
5562136241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21149070.
The product of its digits is 43200, while the sum is 35.
The square root of 5562136241 is about 74579.7307651348. The cubic root of 5562136241 is about 1771.7966415505.
Adding to 5562136241 its reverse (1426312655), we get a palindrome (6988448896).
The spelling of 5562136241 in words is "five billion, five hundred sixty-two million, one hundred thirty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •