Base | Representation |
---|---|
bin | 1110001110111111000100… |
… | …00110110011010111000001 |
3 | 11002211100220211220201200221 |
4 | 13013133202012303113001 |
5 | 13100314344322320001 |
6 | 150323325414143041 |
7 | 6410303262045016 |
oct | 707374206632701 |
9 | 132740824821627 |
10 | 31301220120001 |
11 | 9a78855811487 |
12 | 3616477351a81 |
13 | 1460900253a90 |
14 | 7a2db69c170d |
15 | 39433adb11a1 |
hex | 1c77e21b35c1 |
31301220120001 has 8 divisors (see below), whose sum is σ = 35691889005864. Its totient is φ = 27193820194560.
The previous prime is 31301220119987. The next prime is 31301220120019. The reversal of 31301220120001 is 10002102210313.
It can be written as a sum of positive squares in 4 ways, for example, as 1110755797776 + 30190464322225 = 1053924^2 + 5494585^2 .
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 31301220120001 - 29 = 31301220119489 is a prime.
It is not an unprimeable number, because it can be changed into a prime (31301220120041) 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, 70817239870 + ... + 70817240311.
It is an arithmetic number, because the mean of its divisors is an integer number (4461486125733).
Almost surely, 231301220120001 is an apocalyptic number.
It is an amenable number.
31301220120001 is a deficient number, since it is larger than the sum of its proper divisors (4390668885863).
31301220120001 is a wasteful number, since it uses less digits than its factorization.
31301220120001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 141634480211.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 31301220120001 its reverse (10002102210313), we get a palindrome (41303322330314).
The spelling of 31301220120001 in words is "thirty-one trillion, three hundred one billion, two hundred twenty million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •