Base | Representation |
---|---|
bin | 11110000010011110111010… |
… | …001100111110110110101100 |
3 | 122022202210020000221022222111 |
4 | 132002132322030332312230 |
5 | 114304010410343214040 |
6 | 1144551231525053404 |
7 | 36553531042201345 |
oct | 3602367214766654 |
9 | 568683200838874 |
10 | 132112023023020 |
11 | 39105437930277 |
12 | 12998241257264 |
13 | 5894158491ba1 |
14 | 248a3827a10cc |
15 | 104180c07cdea |
hex | 7827ba33edac |
132112023023020 has 12 divisors (see below), whose sum is σ = 277435248348384. Its totient is φ = 52844809209200.
The previous prime is 132112023022981. The next prime is 132112023023051. The reversal of 132112023023020 is 20320320211231.
It is a junction number, because it is equal to n+sod(n) for n = 132112023022982 and 132112023023000.
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, 3302800575556 + ... + 3302800575595.
It is an arithmetic number, because the mean of its divisors is an integer number (23119604029032).
Almost surely, 2132112023023020 is an apocalyptic number.
132112023023020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132112023023020 is an abundant number, since it is smaller than the sum of its proper divisors (145323225325364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132112023023020 is a wasteful number, since it uses less digits than its factorization.
132112023023020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6605601151160 (or 6605601151158 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 132112023023020 its reverse (20320320211231), we get a palindrome (152432343234251).
The spelling of 132112023023020 in words is "one hundred thirty-two trillion, one hundred twelve billion, twenty-three million, twenty-three thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •