Base | Representation |
---|---|
bin | 110001001111011000010101… |
… | …1100001111101010101101101 |
3 | 2002210120002122121121022122201 |
4 | 1202132300223201331111231 |
5 | 423232234200023220414 |
6 | 4133101404522341501 |
7 | 160142030100206401 |
oct | 14236605341752555 |
9 | 2083502577538581 |
10 | 433122412320109 |
11 | 116008202305326 |
12 | 406b203765a891 |
13 | 1578a3643b47b5 |
14 | 78d534537d101 |
15 | 35117942ad574 |
hex | 189ec2b87d56d |
433122412320109 has 4 divisors (see below), whose sum is σ = 433356912815904. Its totient is φ = 432887911824316.
The previous prime is 433122412320097. The next prime is 433122412320127. The reversal of 433122412320109 is 901023214221334.
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 not a de Polignac number, because 433122412320109 - 213 = 433122412311917 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (433122412320179) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 117250245127 + ... + 117250248820.
It is an arithmetic number, because the mean of its divisors is an integer number (108339228203976).
Almost surely, 2433122412320109 is an apocalyptic number.
It is an amenable number.
433122412320109 is a deficient number, since it is larger than the sum of its proper divisors (234500495795).
433122412320109 is a wasteful number, since it uses less digits than its factorization.
433122412320109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234500495794.
The product of its (nonzero) digits is 62208, while the sum is 37.
The spelling of 433122412320109 in words is "four hundred thirty-three trillion, one hundred twenty-two billion, four hundred twelve million, three hundred twenty thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •