Base | Representation |
---|---|
bin | 100000111001110… |
… | …0000001000110111 |
3 | 2211221102000202111 |
4 | 1001303200020313 |
5 | 4230112120043 |
6 | 301314551451 |
7 | 36234005161 |
oct | 10163401067 |
9 | 2757360674 |
10 | 1104020023 |
11 | 517210647 |
12 | 269898587 |
13 | 14795a6b2 |
14 | a68a7931 |
15 | 66dcc09d |
hex | 41ce0237 |
1104020023 has 32 divisors (see below), whose sum is σ = 1226700800. Its totient is φ = 989853696.
The previous prime is 1104020011. The next prime is 1104020039. The reversal of 1104020023 is 3200204011.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1104020023 is a prime.
It is a super-2 number, since 2×11040200232 = 2437720422369841058, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1104019985 and 1104020012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1104020123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5720215 + ... + 5720407.
It is an arithmetic number, because the mean of its divisors is an integer number (38334400).
Almost surely, 21104020023 is an apocalyptic number.
1104020023 is a deficient number, since it is larger than the sum of its proper divisors (122680777).
1104020023 is a wasteful number, since it uses less digits than its factorization.
1104020023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 431.
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 1104020023 is about 33226.7967610482. The cubic root of 1104020023 is about 1033.5360987345.
Adding to 1104020023 its reverse (3200204011), we get a palindrome (4304224034).
The spelling of 1104020023 in words is "one billion, one hundred four million, twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •