Base | Representation |
---|---|
bin | 1001100100111010… |
… | …00000101010110101 |
3 | 111021022111212011221 |
4 | 10302131000222311 |
5 | 41012201324023 |
6 | 2210102430341 |
7 | 241260313423 |
oct | 46235005265 |
9 | 14238455157 |
10 | 5141433013 |
11 | 21a92287a2 |
12 | bb5a323b1 |
13 | 63c24b272 |
14 | 36ab9a113 |
15 | 20159285d |
hex | 132740ab5 |
5141433013 has 4 divisors (see below), whose sum is σ = 5280390700. Its totient is φ = 5002475328.
The previous prime is 5141432999. The next prime is 5141433019. The reversal of 5141433013 is 3103341415.
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 2173144689 + 2968288324 = 46617^2 + 54482^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5141433013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5141433019) 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, 69478788 + ... + 69478861.
It is an arithmetic number, because the mean of its divisors is an integer number (1320097675).
Almost surely, 25141433013 is an apocalyptic number.
It is an amenable number.
5141433013 is a deficient number, since it is larger than the sum of its proper divisors (138957687).
5141433013 is a wasteful number, since it uses less digits than its factorization.
5141433013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138957686.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 5141433013 is about 71703.7866015457. The cubic root of 5141433013 is about 1725.9494053129.
Adding to 5141433013 its reverse (3103341415), we get a palindrome (8244774428).
The spelling of 5141433013 in words is "five billion, one hundred forty-one million, four hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •