Base | Representation |
---|---|
bin | 111111000010101011011… |
… | …110110101010110010101 |
3 | 120100011011202011111200000 |
4 | 333002223132311112111 |
5 | 1031434323212134031 |
6 | 13114104223041513 |
7 | 624664024412103 |
oct | 77025336652625 |
9 | 16304152144600 |
10 | 4332204021141 |
11 | 1420306258677 |
12 | 59b73a440299 |
13 | 2556a97cb149 |
14 | 10d9734d2c73 |
15 | 77a55a063e6 |
hex | 3f0ab7b5595 |
4332204021141 has 48 divisors (see below), whose sum is σ = 6812265707520. Its totient is φ = 2747597675760.
The previous prime is 4332204021139. The next prime is 4332204021149. The reversal of 4332204021141 is 1411204022334.
4332204021141 is a `hidden beast` number, since 4 + 33 + 220 + 402 + 1 + 1 + 4 + 1 = 666.
It is not a de Polignac number, because 4332204021141 - 21 = 4332204021139 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4332204021149) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4429255 + ... + 5318148.
It is an arithmetic number, because the mean of its divisors is an integer number (141922202240).
Almost surely, 24332204021141 is an apocalyptic number.
It is an amenable number.
4332204021141 is a deficient number, since it is larger than the sum of its proper divisors (2480061686379).
4332204021141 is an equidigital number, since it uses as much as digits as its factorization.
4332204021141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9747508 (or 9747496 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 4332204021141 its reverse (1411204022334), we get a palindrome (5743408043475).
The spelling of 4332204021141 in words is "four trillion, three hundred thirty-two billion, two hundred four million, twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •