Base | Representation |
---|---|
bin | 1001100100101000111100… |
… | …11000101101000010111111 |
3 | 2202112101002202121222102011 |
4 | 10302110132120231002333 |
5 | 10224341143443311033 |
6 | 112434145231312051 |
7 | 4301552130050020 |
oct | 462243630550277 |
9 | 82471082558364 |
10 | 21050144510143 |
11 | 6786352888651 |
12 | 243b7aa97b627 |
13 | b99035248448 |
14 | 52ab92290c47 |
15 | 2678689d9ccd |
hex | 13251e62d0bf |
21050144510143 has 4 divisors (see below), whose sum is σ = 24057308011600. Its totient is φ = 18042981008688.
The previous prime is 21050144510093. The next prime is 21050144510147. The reversal of 21050144510143 is 34101544105012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21050144510143 - 217 = 21050144379071 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21050144510147) 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 3 ways as a sum of consecutive naturals, for example, 1503581750718 + ... + 1503581750731.
It is an arithmetic number, because the mean of its divisors is an integer number (6014327002900).
Almost surely, 221050144510143 is an apocalyptic number.
21050144510143 is a deficient number, since it is larger than the sum of its proper divisors (3007163501457).
21050144510143 is an equidigital number, since it uses as much as digits as its factorization.
21050144510143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3007163501456.
The product of its (nonzero) digits is 9600, while the sum is 31.
Adding to 21050144510143 its reverse (34101544105012), we get a palindrome (55151688615155).
The spelling of 21050144510143 in words is "twenty-one trillion, fifty billion, one hundred forty-four million, five hundred ten thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •