Base | Representation |
---|---|
bin | 1001110000000001000010… |
… | …00011000101111000110111 |
3 | 2210220202001022220020112012 |
4 | 10320000201003011320313 |
5 | 10302242212441402221 |
6 | 113333512421514435 |
7 | 4342030512101432 |
oct | 470004103057067 |
9 | 83822038806465 |
10 | 21441031200311 |
11 | 69170aa167428 |
12 | 24a34b9b72a1b |
13 | bc6b5a7b2758 |
14 | 541a73d84819 |
15 | 272ae52c365b |
hex | 1380210c5e37 |
21441031200311 has 8 divisors (see below), whose sum is σ = 22268745147600. Its totient is φ = 20619208456000.
The previous prime is 21441031200301. The next prime is 21441031200359. The reversal of 21441031200311 is 11300213014412.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21441031200311 - 226 = 21440964091447 is a prime.
It is a super-2 number, since 2×214410312003112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21441031200301) 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, 1472793326 + ... + 1472807883.
It is an arithmetic number, because the mean of its divisors is an integer number (2783593143450).
Almost surely, 221441031200311 is an apocalyptic number.
21441031200311 is a deficient number, since it is larger than the sum of its proper divisors (827713947289).
21441031200311 is a wasteful number, since it uses less digits than its factorization.
21441031200311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2945601489.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 21441031200311 its reverse (11300213014412), we get a palindrome (32741244214723).
The spelling of 21441031200311 in words is "twenty-one trillion, four hundred forty-one billion, thirty-one million, two hundred thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •