Base | Representation |
---|---|
bin | 100101011111001001101… |
… | …1110011010101101111101 |
3 | 200020112120111101112102202 |
4 | 1022332103132122231331 |
5 | 1133403040320344123 |
6 | 14542505505001245 |
7 | 1041141555346502 |
oct | 112762336325575 |
9 | 20215514345382 |
10 | 5152140012413 |
11 | 17070127a2709 |
12 | 6b2629323225 |
13 | 2b4ac9b00954 |
14 | 13b51743b4a9 |
15 | 8e04411da28 |
hex | 4af9379ab7d |
5152140012413 has 4 divisors (see below), whose sum is σ = 5271957222048. Its totient is φ = 5032322802780.
The previous prime is 5152140012391. The next prime is 5152140012473. The reversal of 5152140012413 is 3142100412515.
It is a happy number.
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 5152140012413 - 28 = 5152140012157 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5152140012473) 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, 59908604753 + ... + 59908604838.
It is an arithmetic number, because the mean of its divisors is an integer number (1317989305512).
Almost surely, 25152140012413 is an apocalyptic number.
It is an amenable number.
5152140012413 is a deficient number, since it is larger than the sum of its proper divisors (119817209635).
5152140012413 is a wasteful number, since it uses less digits than its factorization.
5152140012413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119817209634.
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 5152140012413 its reverse (3142100412515), we get a palindrome (8294240424928).
The spelling of 5152140012413 in words is "five trillion, one hundred fifty-two billion, one hundred forty million, twelve thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •