Base | Representation |
---|---|
bin | 100101111011100111010… |
… | …0101101011110101100111 |
3 | 200110101100010220102202101 |
4 | 1023313032211223311213 |
5 | 1140403224344043211 |
6 | 15030534510352531 |
7 | 1045434322014301 |
oct | 113671645536547 |
9 | 20411303812671 |
10 | 5213261315431 |
11 | 172aa28115284 |
12 | 7024467bb747 |
13 | 2ba7ba95a040 |
14 | 140474bb6971 |
15 | 909200145c1 |
hex | 4bdce96bd67 |
5213261315431 has 4 divisors (see below), whose sum is σ = 5614281416632. Its totient is φ = 4812241214232.
The previous prime is 5213261315413. The next prime is 5213261315503. The reversal of 5213261315431 is 1345131623125.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5213261315431 - 27 = 5213261315303 is a prime.
It is a super-2 number, since 2×52132613154312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5213261315401) 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, 200510050581 + ... + 200510050606.
It is an arithmetic number, because the mean of its divisors is an integer number (1403570354158).
Almost surely, 25213261315431 is an apocalyptic number.
5213261315431 is a deficient number, since it is larger than the sum of its proper divisors (401020101201).
5213261315431 is a wasteful number, since it uses less digits than its factorization.
5213261315431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401020101200.
The product of its digits is 64800, while the sum is 37.
Adding to 5213261315431 its reverse (1345131623125), we get a palindrome (6558392938556).
The spelling of 5213261315431 in words is "five trillion, two hundred thirteen billion, two hundred sixty-one million, three hundred fifteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •