Base | Representation |
---|---|
bin | 111101000011000101… |
… | …1001110110010110001 |
3 | 110112101120222121211200 |
4 | 1322012023032302301 |
5 | 4121443112010001 |
6 | 140120534201413 |
7 | 12320532356100 |
oct | 1720613166261 |
9 | 415346877750 |
10 | 131100110001 |
11 | 5066565a053 |
12 | 214a91b3269 |
13 | c493a935b3 |
14 | 64b9636037 |
15 | 362471c086 |
hex | 1e862cecb1 |
131100110001 has 72 divisors (see below), whose sum is σ = 222173733600. Its totient is φ = 74273189760.
The previous prime is 131100109979. The next prime is 131100110039. The reversal of 131100110001 is 100011001131.
It is not a de Polignac number, because 131100110001 - 214 = 131100093617 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (131100110041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 80975170 + ... + 80976788.
It is an arithmetic number, because the mean of its divisors is an integer number (3085746300).
Almost surely, 2131100110001 is an apocalyptic number.
It is an amenable number.
131100110001 is a deficient number, since it is larger than the sum of its proper divisors (91073623599).
131100110001 is a wasteful number, since it uses less digits than its factorization.
131100110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3099 (or 3089 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 9.
Adding to 131100110001 its reverse (100011001131), we get a palindrome (231111111132).
The spelling of 131100110001 in words is "one hundred thirty-one billion, one hundred million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •