Base | Representation |
---|---|
bin | 1100100110111110100… |
… | …00010011010011001001 |
3 | 1112102021101212022011102 |
4 | 12103133100103103021 |
5 | 24044240013301441 |
6 | 531010114311145 |
7 | 43205101656020 |
oct | 6233720232311 |
9 | 1472241768142 |
10 | 433242322121 |
11 | 157811aa5a94 |
12 | 6bb6bb884b5 |
13 | 31b1566c72b |
14 | 16d7d0918b7 |
15 | b409ed069b |
hex | 64df4134c9 |
433242322121 has 4 divisors (see below), whose sum is σ = 495134082432. Its totient is φ = 371350561812.
The previous prime is 433242322099. The next prime is 433242322153. The reversal of 433242322121 is 121223242334.
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 433242322121 - 210 = 433242321097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (433242322181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30945880145 + ... + 30945880158.
It is an arithmetic number, because the mean of its divisors is an integer number (123783520608).
Almost surely, 2433242322121 is an apocalyptic number.
It is an amenable number.
433242322121 is a deficient number, since it is larger than the sum of its proper divisors (61891760311).
433242322121 is an equidigital number, since it uses as much as digits as its factorization.
433242322121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61891760310.
The product of its digits is 13824, while the sum is 29.
Adding to 433242322121 its reverse (121223242334), we get a palindrome (554465564455).
The spelling of 433242322121 in words is "four hundred thirty-three billion, two hundred forty-two million, three hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •