Base | Representation |
---|---|
bin | 111101110010111110… |
… | …1000100101000111010 |
3 | 110200112120122122210022 |
4 | 1323211331010220322 |
5 | 4133240443324010 |
6 | 140544215450442 |
7 | 12405413661041 |
oct | 1734575045072 |
9 | 420476578708 |
10 | 132707011130 |
11 | 5130a714711 |
12 | 21877386a22 |
13 | c68b974575 |
14 | 65ccc05558 |
15 | 36ba830d55 |
hex | 1ee5f44a3a |
132707011130 has 8 divisors (see below), whose sum is σ = 238872620052. Its totient is φ = 53082804448.
The previous prime is 132707011109. The next prime is 132707011147. The reversal of 132707011130 is 31110707231.
It can be written as a sum of positive squares in 2 ways, for example, as 128186196961 + 4520814169 = 358031^2 + 67237^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1327070111302 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 132707011130.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6635350547 + ... + 6635350566.
Almost surely, 2132707011130 is an apocalyptic number.
132707011130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132707011130 is a deficient number, since it is larger than the sum of its proper divisors (106165608922).
132707011130 is a wasteful number, since it uses less digits than its factorization.
132707011130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13270701120.
The product of its (nonzero) digits is 882, while the sum is 26.
Adding to 132707011130 its reverse (31110707231), we get a palindrome (163817718361).
The spelling of 132707011130 in words is "one hundred thirty-two billion, seven hundred seven million, eleven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •