Base | Representation |
---|---|
bin | 11101110010100110001010… |
… | …100000000101011100101011 |
3 | 122011220102022001101221200201 |
4 | 131302212022200011130223 |
5 | 114133114034030444321 |
6 | 1142353521222013031 |
7 | 36411622125320434 |
oct | 3562461240053453 |
9 | 564812261357621 |
10 | 131020301031211 |
11 | 38824441270369 |
12 | 12840741877177 |
13 | 58152136c7917 |
14 | 244d5b888c48b |
15 | 10232131e0291 |
hex | 77298a80572b |
131020301031211 has 8 divisors (see below), whose sum is σ = 131165125604000. Its totient is φ = 130875481365120.
The previous prime is 131020301031181. The next prime is 131020301031229. The reversal of 131020301031211 is 112130103020131.
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 131020301031211 - 29 = 131020301030699 is a prime.
It is a super-2 number, since 2×1310203010312112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131020301011211) 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, 53558515 + ... + 55951363.
It is an arithmetic number, because the mean of its divisors is an integer number (16395640700500).
Almost surely, 2131020301031211 is an apocalyptic number.
131020301031211 is a deficient number, since it is larger than the sum of its proper divisors (144824572789).
131020301031211 is an equidigital number, since it uses as much as digits as its factorization.
131020301031211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2453349.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 131020301031211 its reverse (112130103020131), we get a palindrome (243150404051342).
The spelling of 131020301031211 in words is "one hundred thirty-one trillion, twenty billion, three hundred one million, thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •