Base | Representation |
---|---|
bin | 100001011110000… |
… | …0001111110110101 |
3 | 2220021011222200022 |
4 | 1002330001332311 |
5 | 4244444024023 |
6 | 303234254525 |
7 | 36554423504 |
oct | 10274017665 |
9 | 2807158608 |
10 | 1123033013 |
11 | 526a17363 |
12 | 274127445 |
13 | 14b88679b |
14 | a921683b |
15 | 688d57c8 |
hex | 42f01fb5 |
1123033013 has 2 divisors, whose sum is σ = 1123033014. Its totient is φ = 1123033012.
The previous prime is 1123033007. The next prime is 1123033027. The reversal of 1123033013 is 3103303211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 855972049 + 267060964 = 29257^2 + 16342^2 .
It is a cyclic number.
It is not a de Polignac number, because 1123033013 - 216 = 1122967477 is a prime.
It is a super-2 number, since 2×11230330132 = 2522406296575716338, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1123032982 and 1123033000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1123033313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561516506 + 561516507.
It is an arithmetic number, because the mean of its divisors is an integer number (561516507).
Almost surely, 21123033013 is an apocalyptic number.
It is an amenable number.
1123033013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1123033013 is an equidigital number, since it uses as much as digits as its factorization.
1123033013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162, while the sum is 17.
The square root of 1123033013 is about 33511.6847233916. The cubic root of 1123033013 is about 1039.4354100848.
Adding to 1123033013 its reverse (3103303211), we get a palindrome (4226336224).
The spelling of 1123033013 in words is "one billion, one hundred twenty-three million, thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •