Base | Representation |
---|---|
bin | 1001101101100000010011… |
… | …10101111110100000001111 |
3 | 2210121111022201120010202121 |
4 | 10312300021311332200033 |
5 | 10244334003042242203 |
6 | 113230122220233411 |
7 | 4332554266432204 |
oct | 466601165764017 |
9 | 83544281503677 |
10 | 21354742540303 |
11 | 689354a4a0a77 |
12 | 248a83809b867 |
13 | bbb988854853 |
14 | 53b809d39cab |
15 | 270744b9d0bd |
hex | 136c09d7e80f |
21354742540303 has 2 divisors, whose sum is σ = 21354742540304. Its totient is φ = 21354742540302.
The previous prime is 21354742540279. The next prime is 21354742540319. The reversal of 21354742540303 is 30304524745312.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 21354742540303 - 29 = 21354742539791 is a prime.
It is a super-3 number, since 3×213547425403033 (a number of 41 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21354742540303.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21354742540403) 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 as a sum of consecutive naturals, namely, 10677371270151 + 10677371270152.
It is an arithmetic number, because the mean of its divisors is an integer number (10677371270152).
Almost surely, 221354742540303 is an apocalyptic number.
21354742540303 is a deficient number, since it is larger than the sum of its proper divisors (1).
21354742540303 is an equidigital number, since it uses as much as digits as its factorization.
21354742540303 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1209600, while the sum is 43.
The spelling of 21354742540303 in words is "twenty-one trillion, three hundred fifty-four billion, seven hundred forty-two million, five hundred forty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •