Base | Representation |
---|---|
bin | 1100010100100010001… |
… | …11101010111011010001 |
3 | 1111110201101201112110212 |
4 | 12022101013222323101 |
5 | 23414000411032121 |
6 | 522251433333505 |
7 | 42404540252504 |
oct | 6122107527321 |
9 | 1443641645425 |
10 | 423341502161 |
11 | 1535a1272456 |
12 | 6a068267295 |
13 | 30bc8399796 |
14 | 166c018913b |
15 | b02abb425b |
hex | 62911eaed1 |
423341502161 has 4 divisors (see below), whose sum is σ = 429660032112. Its totient is φ = 417022972212.
The previous prime is 423341502149. The next prime is 423341502191. The reversal of 423341502161 is 161205143324.
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 423341502161 - 210 = 423341501137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (423341502191) 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, 3159264875 + ... + 3159265008.
It is an arithmetic number, because the mean of its divisors is an integer number (107415008028).
Almost surely, 2423341502161 is an apocalyptic number.
It is an amenable number.
423341502161 is a deficient number, since it is larger than the sum of its proper divisors (6318529951).
423341502161 is an equidigital number, since it uses as much as digits as its factorization.
423341502161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6318529950.
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 423341502161 its reverse (161205143324), we get a palindrome (584546645485).
The spelling of 423341502161 in words is "four hundred twenty-three billion, three hundred forty-one million, five hundred two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •