Base | Representation |
---|---|
bin | 1110100110111100011001… |
… | …10000110110001111111101 |
3 | 11012202001202012112012221110 |
4 | 13103132030300312033331 |
5 | 13202311304014202031 |
6 | 152153431123552233 |
7 | 6523625060545431 |
oct | 723361460661775 |
9 | 135661665465843 |
10 | 32124422022141 |
11 | a265988827709 |
12 | 3729b17b2b679 |
13 | 14c0421061617 |
14 | 7d0b8a5909c1 |
15 | 3aa96b095c46 |
hex | 1d378cc363fd |
32124422022141 has 8 divisors (see below), whose sum is σ = 42834281667520. Its totient is φ = 21415421862432.
The previous prime is 32124422022131. The next prime is 32124422022197. The reversal of 32124422022141 is 14122022442123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 32124422022141 - 25 = 32124422022109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32124422022099 and 32124422022108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32124422022131) 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, 214784200 + ... + 214933713.
It is an arithmetic number, because the mean of its divisors is an integer number (5354285208440).
Almost surely, 232124422022141 is an apocalyptic number.
It is an amenable number.
32124422022141 is a deficient number, since it is larger than the sum of its proper divisors (10709859645379).
32124422022141 is a wasteful number, since it uses less digits than its factorization.
32124422022141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 429742835.
The product of its (nonzero) digits is 12288, while the sum is 30.
Adding to 32124422022141 its reverse (14122022442123), we get a palindrome (46246444464264).
The spelling of 32124422022141 in words is "thirty-two trillion, one hundred twenty-four billion, four hundred twenty-two million, twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •