Base | Representation |
---|---|
bin | 1110100110110110001101… |
… | …10100100011000000011100 |
3 | 11012201202011202122001111010 |
4 | 13103123012310203000130 |
5 | 13202233003340300012 |
6 | 152152121413055220 |
7 | 6523446554316006 |
oct | 723330664430034 |
9 | 135652152561433 |
10 | 32121101103132 |
11 | a2645341a5048 |
12 | 372934b927510 |
13 | 14c00120367a2 |
14 | 7d09534cb376 |
15 | 3aa82475ec3c |
hex | 1d36c6d2301c |
32121101103132 has 24 divisors (see below), whose sum is σ = 76004858950272. Its totient is φ = 10556230409200.
The previous prime is 32121101103131. The next prime is 32121101103167. The reversal of 32121101103132 is 23130110112123.
It is a junction number, because it is equal to n+sod(n) for n = 32121101103099 and 32121101103108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32121101103131) 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, 18850410594 + ... + 18850412297.
It is an arithmetic number, because the mean of its divisors is an integer number (3166869122928).
Almost surely, 232121101103132 is an apocalyptic number.
It is an amenable number.
32121101103132 is an abundant number, since it is smaller than the sum of its proper divisors (43883757847140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32121101103132 is a wasteful number, since it uses less digits than its factorization.
32121101103132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37700822969 (or 37700822967 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 32121101103132 its reverse (23130110112123), we get a palindrome (55251211215255).
The spelling of 32121101103132 in words is "thirty-two trillion, one hundred twenty-one billion, one hundred one million, one hundred three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •