Base | Representation |
---|---|
bin | 101010011010010… |
… | …1101100010001101 |
3 | 10200011211011212210 |
4 | 1110310231202031 |
5 | 10403303313031 |
6 | 353114021033 |
7 | 50160120444 |
oct | 12464554215 |
9 | 3604734783 |
10 | 1423104141 |
11 | 67033a228 |
12 | 338717779 |
13 | 198aaaa74 |
14 | d7007d5b |
15 | 84e0a746 |
hex | 54d2d88d |
1423104141 has 4 divisors (see below), whose sum is σ = 1897472192. Its totient is φ = 948736092.
The previous prime is 1423104127. The next prime is 1423104143. The reversal of 1423104141 is 1414013241.
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 not a de Polignac number, because 1423104141 - 215 = 1423071373 is a prime.
It is a super-2 number, since 2×14231041412 = 4050450792262695762, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1423104143) 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, 237184021 + ... + 237184026.
It is an arithmetic number, because the mean of its divisors is an integer number (474368048).
Almost surely, 21423104141 is an apocalyptic number.
It is an amenable number.
1423104141 is a deficient number, since it is larger than the sum of its proper divisors (474368051).
1423104141 is an equidigital number, since it uses as much as digits as its factorization.
1423104141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 474368050.
The product of its (nonzero) digits is 384, while the sum is 21.
The square root of 1423104141 is about 37724.0525527150. The cubic root of 1423104141 is about 1124.8092887587.
Adding to 1423104141 its reverse (1414013241), we get a palindrome (2837117382).
The spelling of 1423104141 in words is "one billion, four hundred twenty-three million, one hundred four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •