Base | Representation |
---|---|
bin | 101000110101101011110… |
… | …0101011100110000011011 |
3 | 201212120201202121111201122 |
4 | 1101223113211130300123 |
5 | 1213430101104112011 |
6 | 15534301030435455 |
7 | 1116341340400160 |
oct | 121532745346033 |
9 | 21776652544648 |
10 | 5612844207131 |
11 | 1874437256a77 |
12 | 767982202b8b |
13 | 31939aa46925 |
14 | 15593d800067 |
15 | 9b009eba3db |
hex | 51ad795cc1b |
5612844207131 has 16 divisors (see below), whose sum is σ = 6565949973504. Its totient is φ = 4698018297024.
The previous prime is 5612844207109. The next prime is 5612844207149. The reversal of 5612844207131 is 1317024482165.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 5612844207131 - 226 = 5612777098267 is a prime.
It is a super-2 number, since 2×56128442071312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5612844207331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19109690 + ... + 19401183.
It is an arithmetic number, because the mean of its divisors is an integer number (410371873344).
Almost surely, 25612844207131 is an apocalyptic number.
5612844207131 is a deficient number, since it is larger than the sum of its proper divisors (953105766373).
5612844207131 is a wasteful number, since it uses less digits than its factorization.
5612844207131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38511370.
The product of its (nonzero) digits is 322560, while the sum is 44.
Adding to 5612844207131 its reverse (1317024482165), we get a palindrome (6929868689296).
The spelling of 5612844207131 in words is "five trillion, six hundred twelve billion, eight hundred forty-four million, two hundred seven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •