Base | Representation |
---|---|
bin | 11101110010100101111110… |
… | …100010011100001011010001 |
3 | 122011220101210001201212102021 |
4 | 131302211332202130023101 |
5 | 114133113131140301001 |
6 | 1142353445252051441 |
7 | 36411614140320412 |
oct | 3562457642341321 |
9 | 564811701655367 |
10 | 131020100322001 |
11 | 38824348a43590 |
12 | 128406a6603b81 |
13 | 58151b0c52887 |
14 | 244d599d63809 |
15 | 1023200795ba1 |
hex | 77297e89c2d1 |
131020100322001 has 8 divisors (see below), whose sum is σ = 145064317317984. Its totient is φ = 117331433123520.
The previous prime is 131020100321977. The next prime is 131020100322031. The reversal of 131020100322001 is 100223001020131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131020100322001 - 29 = 131020100321489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131020100322031) 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, 88887448600 + ... + 88887450073.
It is an arithmetic number, because the mean of its divisors is an integer number (18133039664748).
Almost surely, 2131020100322001 is an apocalyptic number.
131020100322001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
131020100322001 is a deficient number, since it is larger than the sum of its proper divisors (14044216995983).
131020100322001 is a wasteful number, since it uses less digits than its factorization.
131020100322001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177774898751.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 131020100322001 its reverse (100223001020131), we get a palindrome (231243101342132).
The spelling of 131020100322001 in words is "one hundred thirty-one trillion, twenty billion, one hundred million, three hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •