Base | Representation |
---|---|
bin | 10111101101001110001000… |
… | …10110001010000001111111 |
3 | 20211120201000210002202010120 |
4 | 23312213010112022001333 |
5 | 23313104411411323033 |
6 | 302512443314510023 |
7 | 13660235341344561 |
oct | 1366470426120177 |
9 | 224521023082116 |
10 | 52131312214143 |
11 | 156798467589a8 |
12 | 5a1b492b95313 |
13 | 2311c66982436 |
14 | cc3251943331 |
15 | 6060c5ca51b3 |
hex | 2f69c458a07f |
52131312214143 has 8 divisors (see below), whose sum is σ = 69689900402688. Its totient is φ = 34663466084184.
The previous prime is 52131312214139. The next prime is 52131312214147. The reversal of 52131312214143 is 34141221313125.
It is an interprime number because it is at equal distance from previous prime (52131312214139) and next prime (52131312214147).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 52131312214143 - 22 = 52131312214139 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52131312214147) 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, 22685513305 + ... + 22685515602.
It is an arithmetic number, because the mean of its divisors is an integer number (8711237550336).
Almost surely, 252131312214143 is an apocalyptic number.
52131312214143 is a deficient number, since it is larger than the sum of its proper divisors (17558588188545).
52131312214143 is a wasteful number, since it uses less digits than its factorization.
52131312214143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45371029293.
The product of its digits is 17280, while the sum is 33.
Adding to 52131312214143 its reverse (34141221313125), we get a palindrome (86272533527268).
The spelling of 52131312214143 in words is "fifty-two trillion, one hundred thirty-one billion, three hundred twelve million, two hundred fourteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •