Base | Representation |
---|---|
bin | 111101000011111110… |
… | …1011000010001010001 |
3 | 110112110200021212210112 |
4 | 1322013331120101101 |
5 | 4122023242030413 |
6 | 140123523411105 |
7 | 12321344614613 |
oct | 1720775302121 |
9 | 415420255715 |
10 | 131130033233 |
11 | 506805378a1 |
12 | 214b7223a95 |
13 | c49a03c654 |
14 | 64bd5c4db3 |
15 | 362717d2a8 |
hex | 1e87f58451 |
131130033233 has 8 divisors (see below), whose sum is σ = 131285100000. Its totient is φ = 130975049088.
The previous prime is 131130033191. The next prime is 131130033259. The reversal of 131130033233 is 332330031131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131130033233 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131130033199 and 131130033208.
It is not an unprimeable number, because it can be changed into a prime (131130033533) 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, 3502310 + ... + 3539552.
It is an arithmetic number, because the mean of its divisors is an integer number (16410637500).
Almost surely, 2131130033233 is an apocalyptic number.
It is an amenable number.
131130033233 is a deficient number, since it is larger than the sum of its proper divisors (155066767).
131130033233 is a wasteful number, since it uses less digits than its factorization.
131130033233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41311.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 131130033233 its reverse (332330031131), we get a palindrome (463460064364).
The spelling of 131130033233 in words is "one hundred thirty-one billion, one hundred thirty million, thirty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •