Base | Representation |
---|---|
bin | 11110000101010000000100… |
… | …000110001111001101100111 |
3 | 122100102222012200020112021002 |
4 | 132011100010012033031213 |
5 | 114320114442240030043 |
6 | 1145214451031343515 |
7 | 36603343606136102 |
oct | 3605200406171547 |
9 | 570388180215232 |
10 | 132302241330023 |
11 | 3917907a133776 |
12 | 12a09088b21b9b |
13 | 58a90810ba82b |
14 | 2495669709739 |
15 | 10467418b7bb8 |
hex | 78540418f367 |
132302241330023 has 8 divisors (see below), whose sum is σ = 140084833948992. Its totient is φ = 124519660692736.
The previous prime is 132302241330013. The next prime is 132302241330089. The reversal of 132302241330023 is 320033142203231.
It is a happy number.
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 132302241330023 - 26 = 132302241329959 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 (132302241330013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30333986 + ... + 34420272.
It is an arithmetic number, because the mean of its divisors is an integer number (17510604243624).
Almost surely, 2132302241330023 is an apocalyptic number.
132302241330023 is a deficient number, since it is larger than the sum of its proper divisors (7782592618969).
132302241330023 is a wasteful number, since it uses less digits than its factorization.
132302241330023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5990841.
The product of its (nonzero) digits is 15552, while the sum is 29.
Adding to 132302241330023 its reverse (320033142203231), we get a palindrome (452335383533254).
The spelling of 132302241330023 in words is "one hundred thirty-two trillion, three hundred two billion, two hundred forty-one million, three hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •