Base | Representation |
---|---|
bin | 1110000110100100101110… |
… | …01011010110001001001101 |
3 | 11001210201220112222010012121 |
4 | 13003102113023112021031 |
5 | 13031100441223223041 |
6 | 145542450314332541 |
7 | 6350362142255461 |
oct | 703222713261115 |
9 | 131721815863177 |
10 | 31012200211021 |
11 | 9977222595077 |
12 | 358a45712a151 |
13 | 143c59019b963 |
14 | 792dd9c4a4a1 |
15 | 38ba7265c7d1 |
hex | 1c34972d624d |
31012200211021 has 8 divisors (see below), whose sum is σ = 31672418730624. Its totient is φ = 30351997711200.
The previous prime is 31012200211007. The next prime is 31012200211039. The reversal of 31012200211021 is 12011200221013.
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 31012200211021 - 213 = 31012200202829 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31012200210986 and 31012200211004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31012200211121) 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, 50880 + ... + 7875721.
It is an arithmetic number, because the mean of its divisors is an integer number (3959052341328).
Almost surely, 231012200211021 is an apocalyptic number.
It is an amenable number.
31012200211021 is a deficient number, since it is larger than the sum of its proper divisors (660218519603).
31012200211021 is an equidigital number, since it uses as much as digits as its factorization.
31012200211021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8009891.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 31012200211021 its reverse (12011200221013), we get a palindrome (43023400432034).
The spelling of 31012200211021 in words is "thirty-one trillion, twelve billion, two hundred million, two hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •