Base | Representation |
---|---|
bin | 1001100100001101011011… |
… | …10101011000100110011101 |
3 | 2202110221222012020012200020 |
4 | 10302012231311120212131 |
5 | 10224120420023120102 |
6 | 112423303254222353 |
7 | 4300520052620154 |
oct | 462065565304635 |
9 | 82427865205606 |
10 | 21035371301277 |
11 | 6780061788123 |
12 | 24389673549b9 |
13 | b9781c6a6c38 |
14 | 52a19022459b |
15 | 2672a1a72bbc |
hex | 1321add5899d |
21035371301277 has 8 divisors (see below), whose sum is σ = 28050171447360. Its totient is φ = 14022076011360.
The previous prime is 21035371301249. The next prime is 21035371301281. The reversal of 21035371301277 is 77210317353012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-21035371301277 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21035371301977) 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 7 ways as a sum of consecutive naturals, for example, 376181424 + ... + 376237337.
It is an arithmetic number, because the mean of its divisors is an integer number (3506271430920).
Almost surely, 221035371301277 is an apocalyptic number.
It is an amenable number.
21035371301277 is a deficient number, since it is larger than the sum of its proper divisors (7014800146083).
21035371301277 is an equidigital number, since it uses as much as digits as its factorization.
21035371301277 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 752428083.
The product of its (nonzero) digits is 185220, while the sum is 42.
Adding to 21035371301277 its reverse (77210317353012), we get a palindrome (98245688654289).
The spelling of 21035371301277 in words is "twenty-one trillion, thirty-five billion, three hundred seventy-one million, three hundred one thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •