Base | Representation |
---|---|
bin | 111101111000011111001… |
… | …101101101100010011011 |
3 | 120001112112220201112112220 |
4 | 331320133031231202123 |
5 | 1024133201033424011 |
6 | 13013331314435123 |
7 | 616143636510201 |
oct | 75703715554233 |
9 | 16045486645486 |
10 | 4252541311131 |
11 | 139a546785553 |
12 | 588207592aa3 |
13 | 24b02251c309 |
14 | 109b77477071 |
15 | 75941e60506 |
hex | 3de1f36d89b |
4252541311131 has 8 divisors (see below), whose sum is σ = 5714701185024. Its totient is φ = 2812704489000.
The previous prime is 4252541311111. The next prime is 4252541311141. The reversal of 4252541311131 is 1311131452524.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4252541311131 - 213 = 4252541302939 is a prime.
It is a super-2 number, since 2×42525413111312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4252541311092 and 4252541311101.
It is not an unprimeable number, because it can be changed into a prime (4252541311111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5580762495 + ... + 5580763256.
It is an arithmetic number, because the mean of its divisors is an integer number (714337648128).
Almost surely, 24252541311131 is an apocalyptic number.
4252541311131 is a deficient number, since it is larger than the sum of its proper divisors (1462159873893).
4252541311131 is a wasteful number, since it uses less digits than its factorization.
4252541311131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11161525881.
The product of its digits is 14400, while the sum is 33.
Adding to 4252541311131 its reverse (1311131452524), we get a palindrome (5563672763655).
The spelling of 4252541311131 in words is "four trillion, two hundred fifty-two billion, five hundred forty-one million, three hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •