Base | Representation |
---|---|
bin | 101101101111110110001100… |
… | …101011111100101100000011 |
3 | 222101101112122010201222011002 |
4 | 231233312030223330230003 |
5 | 202332430302421442011 |
6 | 1551530015040242215 |
7 | 60244141060206230 |
oct | 5557661453745403 |
9 | 871345563658132 |
10 | 201200103312131 |
11 | 59121537053370 |
12 | 1a695b1761036b |
13 | 883611c0a9b11 |
14 | 37981cbb62787 |
15 | 183da22d85c3b |
hex | b6fd8cafcb03 |
201200103312131 has 8 divisors (see below), whose sum is σ = 250846882051584. Its totient is φ = 156779301282120.
The previous prime is 201200103312001. The next prime is 201200103312137. The reversal of 201200103312131 is 131213301002102.
It is a happy number.
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-201200103312131 is a prime.
It is a super-2 number, since 2×2012001033121312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201200103312137) 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, 1306494177275 + ... + 1306494177428.
It is an arithmetic number, because the mean of its divisors is an integer number (31355860256448).
Almost surely, 2201200103312131 is an apocalyptic number.
201200103312131 is a deficient number, since it is larger than the sum of its proper divisors (49646778739453).
201200103312131 is a wasteful number, since it uses less digits than its factorization.
201200103312131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2612988354721.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 201200103312131 its reverse (131213301002102), we get a palindrome (332413404314233).
The spelling of 201200103312131 in words is "two hundred one trillion, two hundred billion, one hundred three million, three hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •