Base | Representation |
---|---|
bin | 1110010011000101111011… |
… | …00001010001000001010011 |
3 | 11010022212011202021122011201 |
4 | 13021202331201101001103 |
5 | 13110122403044033021 |
6 | 150512224531452031 |
7 | 6423430334106646 |
oct | 711427541210123 |
9 | 133285152248151 |
10 | 31442340221011 |
11 | a02269239a035 |
12 | 36398a0157017 |
13 | 1470cccbb3b25 |
14 | 7a9b62ca1a5d |
15 | 397d4a0d9591 |
hex | 1c98bd851053 |
31442340221011 has 4 divisors (see below), whose sum is σ = 31442718321432. Its totient is φ = 31441962120592.
The previous prime is 31442340221009. The next prime is 31442340221023. The reversal of 31442340221011 is 11012204324413.
It is a happy number.
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 31442340221011 - 21 = 31442340221009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31442340221041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 188925445 + ... + 189091798.
It is an arithmetic number, because the mean of its divisors is an integer number (7860679580358).
Almost surely, 231442340221011 is an apocalyptic number.
31442340221011 is a deficient number, since it is larger than the sum of its proper divisors (378100421).
31442340221011 is an equidigital number, since it uses as much as digits as its factorization.
31442340221011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 378100420.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 31442340221011 its reverse (11012204324413), we get a palindrome (42454544545424).
It can be divided in two parts, 314423402 and 21011, that added together give a palindrome (314444413).
The spelling of 31442340221011 in words is "thirty-one trillion, four hundred forty-two billion, three hundred forty million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.761 sec. • engine limits •