Base | Representation |
---|---|
bin | 11000001010100111000110… |
… | …01010010010100001010011 |
3 | 20222011020120212111020100221 |
4 | 30011103203022102201103 |
5 | 23431131032001331233 |
6 | 305004412232253511 |
7 | 14123215102265404 |
oct | 1405234312224123 |
9 | 228136525436327 |
10 | 53141146511443 |
11 | 15a29040900a21 |
12 | 5b6313a541297 |
13 | 238625b4cc0b3 |
14 | d1a08c0d79ab |
15 | 6224caa9742d |
hex | 3054e3292853 |
53141146511443 has 4 divisors (see below), whose sum is σ = 53141182374528. Its totient is φ = 53141110648360.
The previous prime is 53141146511419. The next prime is 53141146511471. The reversal of 53141146511443 is 34411564114135.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53141146511443 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 53141146511443.
It is not an unprimeable number, because it can be changed into a prime (53141146511473) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15608563 + ... + 18705868.
It is an arithmetic number, because the mean of its divisors is an integer number (13285295593632).
Almost surely, 253141146511443 is an apocalyptic number.
53141146511443 is a deficient number, since it is larger than the sum of its proper divisors (35863085).
53141146511443 is a wasteful number, since it uses less digits than its factorization.
53141146511443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35863084.
The product of its digits is 345600, while the sum is 43.
The spelling of 53141146511443 in words is "fifty-three trillion, one hundred forty-one billion, one hundred forty-six million, five hundred eleven thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.482 sec. • engine limits •