Base | Representation |
---|---|
bin | 101010011010001… |
… | …1110110111000101 |
3 | 10200011201010102201 |
4 | 1110310132313011 |
5 | 10403244402122 |
6 | 353112434501 |
7 | 50156450302 |
oct | 12464366705 |
9 | 3604633381 |
10 | 1423044037 |
11 | 6702a9058 |
12 | 3386a8a31 |
13 | 198a895bc |
14 | d6dd00a9 |
15 | 84de7a27 |
hex | 54d1edc5 |
1423044037 has 2 divisors, whose sum is σ = 1423044038. Its totient is φ = 1423044036.
The previous prime is 1423044023. The next prime is 1423044089. The reversal of 1423044037 is 7304403241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1012130596 + 410913441 = 31814^2 + 20271^2 .
It is a cyclic number.
It is not a de Polignac number, because 1423044037 - 211 = 1423041989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1423043996 and 1423044014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1423044097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 711522018 + 711522019.
It is an arithmetic number, because the mean of its divisors is an integer number (711522019).
Almost surely, 21423044037 is an apocalyptic number.
It is an amenable number.
1423044037 is a deficient number, since it is larger than the sum of its proper divisors (1).
1423044037 is an equidigital number, since it uses as much as digits as its factorization.
1423044037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 28.
The square root of 1423044037 is about 37723.2559172720. The cubic root of 1423044037 is about 1124.7934533073.
Adding to 1423044037 its reverse (7304403241), we get a palindrome (8727447278).
The spelling of 1423044037 in words is "one billion, four hundred twenty-three million, forty-four thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •