Base | Representation |
---|---|
bin | 111101000011000111… |
… | …1011110100100100001 |
3 | 110112101200002011212022 |
4 | 1322012033132210201 |
5 | 4121443403120301 |
6 | 140121014111225 |
7 | 12320545003424 |
oct | 1720617364441 |
9 | 415350064768 |
10 | 131101223201 |
11 | 5066624a453 |
12 | 214a964b515 |
13 | c4940931b0 |
14 | 64b98459bb |
15 | 362488bd1b |
hex | 1e863de921 |
131101223201 has 8 divisors (see below), whose sum is σ = 148616771520. Its totient is φ = 114647223312.
The previous prime is 131101223179. The next prime is 131101223219. The reversal of 131101223201 is 102322101131.
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 131101223201 - 230 = 130027481377 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131101223201.
It is not an unprimeable number, because it can be changed into a prime (131101223221) 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 7 ways as a sum of consecutive naturals, for example, 265386845 + ... + 265387338.
It is an arithmetic number, because the mean of its divisors is an integer number (18577096440).
Almost surely, 2131101223201 is an apocalyptic number.
It is an amenable number.
131101223201 is a deficient number, since it is larger than the sum of its proper divisors (17515548319).
131101223201 is a wasteful number, since it uses less digits than its factorization.
131101223201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 530774215.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 131101223201 its reverse (102322101131), we get a palindrome (233423324332).
The spelling of 131101223201 in words is "one hundred thirty-one billion, one hundred one million, two hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •