Base | Representation |
---|---|
bin | 111101000100000011… |
… | …0000110110111010001 |
3 | 110112110211121010100021 |
4 | 1322020012012313101 |
5 | 4122024333234413 |
6 | 140124044423441 |
7 | 12321403224304 |
oct | 1721006066721 |
9 | 415424533307 |
10 | 131132321233 |
11 | 5068185a901 |
12 | 214b7b47b81 |
13 | c49a660bb4 |
14 | 64bda1cb3b |
15 | 362748118d |
hex | 1e88186dd1 |
131132321233 has 8 divisors (see below), whose sum is σ = 136848096000. Its totient is φ = 125417743968.
The previous prime is 131132321231. The next prime is 131132321251. The reversal of 131132321233 is 332123231131.
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 131132321233 - 21 = 131132321231 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131132321198 and 131132321207.
It is not an unprimeable number, because it can be changed into a prime (131132321231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71908 + ... + 517141.
It is an arithmetic number, because the mean of its divisors is an integer number (17106012000).
Almost surely, 2131132321233 is an apocalyptic number.
It is an amenable number.
131132321233 is a deficient number, since it is larger than the sum of its proper divisors (5715774767).
131132321233 is an equidigital number, since it uses as much as digits as its factorization.
131132321233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 598751.
The product of its digits is 1944, while the sum is 25.
Adding to 131132321233 its reverse (332123231131), we get a palindrome (463255552364).
The spelling of 131132321233 in words is "one hundred thirty-one billion, one hundred thirty-two million, three hundred twenty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •