Base | Representation |
---|---|
bin | 111101000011001001… |
… | …1010100011011011001 |
3 | 110112101201222100020210 |
4 | 1322012103110123121 |
5 | 4121444132331413 |
6 | 140121051441333 |
7 | 12320556366402 |
oct | 1720623243331 |
9 | 415351870223 |
10 | 131102230233 |
11 | 50666878007 |
12 | 214a9a56249 |
13 | c494356680 |
14 | 64b9a289a9 |
15 | 36249da3c3 |
hex | 1e864d46d9 |
131102230233 has 8 divisors (see below), whose sum is σ = 188249356288. Its totient is φ = 80678295504.
The previous prime is 131102230213. The next prime is 131102230271. The reversal of 131102230233 is 332032201131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131102230233 - 230 = 130028488409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131102230213) 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, 1680797785 + ... + 1680797862.
It is an arithmetic number, because the mean of its divisors is an integer number (23531169536).
Almost surely, 2131102230233 is an apocalyptic number.
131102230233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
131102230233 is a deficient number, since it is larger than the sum of its proper divisors (57147126055).
131102230233 is a wasteful number, since it uses less digits than its factorization.
131102230233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3361595663.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 131102230233 its reverse (332032201131), we get a palindrome (463134431364).
The spelling of 131102230233 in words is "one hundred thirty-one billion, one hundred two million, two hundred thirty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •