Base | Representation |
---|---|
bin | 11000001101101011001111… |
… | …11110100001100011101111 |
3 | 20222112022101221010112211122 |
4 | 30012311213332201203233 |
5 | 23434342214211342033 |
6 | 305125025553411155 |
7 | 14133633524261030 |
oct | 1406654776414357 |
9 | 228468357115748 |
10 | 53246454012143 |
11 | 15a69770180937 |
12 | 5b7b629869abb |
13 | 23931717932a2 |
14 | d211dbdc2a87 |
15 | 6250e0c29a98 |
hex | 306d67fa18ef |
53246454012143 has 8 divisors (see below), whose sum is σ = 60854344331040. Its totient is φ = 45638877201120.
The previous prime is 53246454012119. The next prime is 53246454012221. The reversal of 53246454012143 is 34121045464235.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 53246454012143 - 210 = 53246454011119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53246454012094 and 53246454012103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53246454012113) 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, 78012908 + ... + 78692481.
It is an arithmetic number, because the mean of its divisors is an integer number (7606793041380).
Almost surely, 253246454012143 is an apocalyptic number.
53246454012143 is a deficient number, since it is larger than the sum of its proper divisors (7607890318897).
53246454012143 is a wasteful number, since it uses less digits than its factorization.
53246454012143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156753937.
The product of its (nonzero) digits is 1382400, while the sum is 44.
Adding to 53246454012143 its reverse (34121045464235), we get a palindrome (87367499476378).
The spelling of 53246454012143 in words is "fifty-three trillion, two hundred forty-six billion, four hundred fifty-four million, twelve thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •