Base | Representation |
---|---|
bin | 111101000011110001… |
… | …1011011110111101001 |
3 | 110112110012111100120122 |
4 | 1322013203123313221 |
5 | 4122020021412413 |
6 | 140123121533025 |
7 | 12321233040620 |
oct | 1720743336751 |
9 | 415405440518 |
10 | 131123232233 |
11 | 50677712134 |
12 | 214b4aa4175 |
13 | c4987caba6 |
14 | 64bc7346b7 |
15 | 3626788108 |
hex | 1e878dbde9 |
131123232233 has 4 divisors (see below), whose sum is σ = 149855122560. Its totient is φ = 112391341908.
The previous prime is 131123232223. The next prime is 131123232239. The reversal of 131123232233 is 332232321131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 131123232233 - 28 = 131123231977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131123232239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9365945153 + ... + 9365945166.
It is an arithmetic number, because the mean of its divisors is an integer number (37463780640).
Almost surely, 2131123232233 is an apocalyptic number.
It is an amenable number.
131123232233 is a deficient number, since it is larger than the sum of its proper divisors (18731890327).
131123232233 is an equidigital number, since it uses as much as digits as its factorization.
131123232233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18731890326.
The product of its digits is 3888, while the sum is 26.
Adding to 131123232233 its reverse (332232321131), we get a palindrome (463355553364).
The spelling of 131123232233 in words is "one hundred thirty-one billion, one hundred twenty-three million, two hundred thirty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •