Base | Representation |
---|---|
bin | 1110100110110110010010… |
… | …10001011110110010001001 |
3 | 11012201202021122001011000020 |
4 | 13103123021101132302021 |
5 | 13202233044403224231 |
6 | 152152125442531053 |
7 | 6523450564100460 |
oct | 723331121366211 |
9 | 135652248034006 |
10 | 32121142242441 |
11 | a26455544367a |
12 | 3729361666a89 |
13 | 14c001a70ba85 |
14 | 7d0958b599d7 |
15 | 3aa828189396 |
hex | 1d36c945ec89 |
32121142242441 has 8 divisors (see below), whose sum is σ = 48946502464704. Its totient is φ = 18354938424240.
The previous prime is 32121142242433. The next prime is 32121142242467. The reversal of 32121142242441 is 14424224112123.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 32121142242441 - 23 = 32121142242433 is a prime.
It is not an unprimeable number, because it can be changed into a prime (32121142242401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 764789100990 + ... + 764789101031.
It is an arithmetic number, because the mean of its divisors is an integer number (6118312808088).
Almost surely, 232121142242441 is an apocalyptic number.
It is an amenable number.
32121142242441 is a deficient number, since it is larger than the sum of its proper divisors (16825360222263).
32121142242441 is a wasteful number, since it uses less digits than its factorization.
32121142242441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1529578202031.
The product of its digits is 24576, while the sum is 33.
Adding to 32121142242441 its reverse (14424224112123), we get a palindrome (46545366354564).
The spelling of 32121142242441 in words is "thirty-two trillion, one hundred twenty-one billion, one hundred forty-two million, two hundred forty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •