Base | Representation |
---|---|
bin | 11110000101011000100000… |
… | …001010000100001011000111 |
3 | 122100110211121010112210000120 |
4 | 132011120200022010023013 |
5 | 114320242021304430043 |
6 | 1145222550101513023 |
7 | 36604114256621064 |
oct | 3605304012041307 |
9 | 570424533483016 |
10 | 132311302030023 |
11 | 391819a9713796 |
12 | 12a0a997412773 |
13 | 58a9b9630158c |
14 | 2495c88c01c6b |
15 | 1046ac2084983 |
hex | 7856202842c7 |
132311302030023 has 8 divisors (see below), whose sum is σ = 176982320401536. Its totient is φ = 87923909172600.
The previous prime is 132311302030013. The next prime is 132311302030067. The reversal of 132311302030023 is 320030203113231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132311302030023 - 221 = 132311299932871 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132311302029975 and 132311302030002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132311302030013) 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, 70906377433 + ... + 70906379298.
It is an arithmetic number, because the mean of its divisors is an integer number (22122790050192).
Almost surely, 2132311302030023 is an apocalyptic number.
132311302030023 is a deficient number, since it is larger than the sum of its proper divisors (44671018371513).
132311302030023 is a wasteful number, since it uses less digits than its factorization.
132311302030023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 141812757045.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 132311302030023 its reverse (320030203113231), we get a palindrome (452341505143254).
The spelling of 132311302030023 in words is "one hundred thirty-two trillion, three hundred eleven billion, three hundred two million, thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •