Base | Representation |
---|---|
bin | 11101111001011000… |
… | …001000011010011001 |
3 | 10001212011221212202121 |
4 | 131321120020122121 |
5 | 1011220342440441 |
6 | 22425210501241 |
7 | 2214332121541 |
oct | 357130103231 |
9 | 101764855677 |
10 | 32101140121 |
11 | 12683290776 |
12 | 627a734821 |
13 | 3047791b8b |
14 | 17a7510321 |
15 | c7d318dd1 |
hex | 779608699 |
32101140121 has 4 divisors (see below), whose sum is σ = 32223197952. Its totient is φ = 31979082292.
The previous prime is 32101140047. The next prime is 32101140151. The reversal of 32101140121 is 12104110123.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32101140121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32101140095 and 32101140104.
It is not an unprimeable number, because it can be changed into a prime (32101140151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 61028521 + ... + 61029046.
It is an arithmetic number, because the mean of its divisors is an integer number (8055799488).
Almost surely, 232101140121 is an apocalyptic number.
It is an amenable number.
32101140121 is a deficient number, since it is larger than the sum of its proper divisors (122057831).
32101140121 is a wasteful number, since it uses less digits than its factorization.
32101140121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122057830.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 32101140121 its reverse (12104110123), we get a palindrome (44205250244).
The spelling of 32101140121 in words is "thirty-two billion, one hundred one million, one hundred forty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •