Base | Representation |
---|---|
bin | 111101100100110011… |
… | …0011111100011100111 |
3 | 110122022102120112222112 |
4 | 1323021212133203213 |
5 | 4131302210030043 |
6 | 140425104151235 |
7 | 12360546521462 |
oct | 1731146374347 |
9 | 418272515875 |
10 | 132231330023 |
11 | 51096158431 |
12 | 2176400851b |
13 | c614255660 |
14 | 65859802d9 |
15 | 368dbbd518 |
hex | 1ec999f8e7 |
132231330023 has 8 divisors (see below), whose sum is σ = 142416865248. Its totient is φ = 122047779744.
The previous prime is 132231330019. The next prime is 132231330037. The reversal of 132231330023 is 320033132231.
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 132231330023 - 22 = 132231330019 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132231330323) 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 7 ways as a sum of consecutive naturals, for example, 356411 + ... + 625692.
It is an arithmetic number, because the mean of its divisors is an integer number (17802108156).
Almost surely, 2132231330023 is an apocalyptic number.
132231330023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
132231330023 is a deficient number, since it is larger than the sum of its proper divisors (10185535225).
132231330023 is a wasteful number, since it uses less digits than its factorization.
132231330023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 992473.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 132231330023 its reverse (320033132231), we get a palindrome (452264462254).
The spelling of 132231330023 in words is "one hundred thirty-two billion, two hundred thirty-one million, three hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •