Base | Representation |
---|---|
bin | 1110100110100111010110… |
… | …10011010011111011011100 |
3 | 11012200222120202211020122120 |
4 | 13103103223103103323130 |
5 | 13202120134020304040 |
6 | 152144322023142540 |
7 | 6523045062343113 |
oct | 723235323237334 |
9 | 135628522736576 |
10 | 32113123213020 |
11 | a26110a959133 |
12 | 37278a3ba4a50 |
13 | 14bc340265255 |
14 | 7d03d7b3ac7a |
15 | 3aa5091807d0 |
hex | 1d34eb4d3edc |
32113123213020 has 48 divisors (see below), whose sum is σ = 92817285163008. Its totient is φ = 8287257602880.
The previous prime is 32113123213009. The next prime is 32113123213133. The reversal of 32113123213020 is 2031232131123.
It is a super-3 number, since 3×321131232130203 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8632558144 + ... + 8632561863.
It is an arithmetic number, because the mean of its divisors is an integer number (1933693440896).
Almost surely, 232113123213020 is an apocalyptic number.
32113123213020 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
32113123213020 is an abundant number, since it is smaller than the sum of its proper divisors (60704161949988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32113123213020 is a wasteful number, since it uses less digits than its factorization.
32113123213020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17265120050 (or 17265120048 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 32113123213020 its reverse (2031232131123), we get a palindrome (34144355344143).
The spelling of 32113123213020 in words is "thirty-two trillion, one hundred thirteen billion, one hundred twenty-three million, two hundred thirteen thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •