Base | Representation |
---|---|
bin | 111101100100100011… |
… | …1111100010000101010 |
3 | 110122021212111122211212 |
4 | 1323021013330100222 |
5 | 4131243132234010 |
6 | 140424220353122 |
7 | 12360421454105 |
oct | 1731107742052 |
9 | 418255448755 |
10 | 132223321130 |
11 | 5109168820a |
12 | 217613a57a2 |
13 | c6126b0174 |
14 | 658489773c |
15 | 368d13a505 |
hex | 1ec91fc42a |
132223321130 has 8 divisors (see below), whose sum is σ = 238001978052. Its totient is φ = 52889328448.
The previous prime is 132223321073. The next prime is 132223321133. The reversal of 132223321130 is 31123322231.
It can be written as a sum of positive squares in 2 ways, for example, as 129984044089 + 2239277041 = 360533^2 + 47321^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 132223321096 and 132223321105.
It is not an unprimeable number, because it can be changed into a prime (132223321133) 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 3 ways as a sum of consecutive naturals, for example, 6611166047 + ... + 6611166066.
Almost surely, 2132223321130 is an apocalyptic number.
132223321130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132223321130 is a deficient number, since it is larger than the sum of its proper divisors (105778656922).
132223321130 is a wasteful number, since it uses less digits than its factorization.
132223321130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13222332120.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 132223321130 its reverse (31123322231), we get a palindrome (163346643361).
The spelling of 132223321130 in words is "one hundred thirty-two billion, two hundred twenty-three million, three hundred twenty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •