Base | Representation |
---|---|
bin | 10000010110010000011… |
… | …101000011110001110101 |
3 | 10222101201101010000222022 |
4 | 100112100131003301311 |
5 | 121401220430013023 |
6 | 2220030515042525 |
7 | 144110101311236 |
oct | 20262035036165 |
9 | 3871641100868 |
10 | 1123410001013 |
11 | 3a3487727273 |
12 | 1618838a0445 |
13 | 81c24a9ab91 |
14 | 3c53260108d |
15 | 1e350c9c7c8 |
hex | 10590743c75 |
1123410001013 has 16 divisors (see below), whose sum is σ = 1169961408000. Its totient is φ = 1077397896960.
The previous prime is 1123410000943. The next prime is 1123410001037. The reversal of 1123410001013 is 3101000143211.
It is a cyclic number.
It is not a de Polignac number, because 1123410001013 - 222 = 1123405806709 is a prime.
It is a super-2 number, since 2×11234100010132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1123410000982 and 1123410001000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123410001073) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3258068 + ... + 3586338.
It is an arithmetic number, because the mean of its divisors is an integer number (73122588000).
Almost surely, 21123410001013 is an apocalyptic number.
It is an amenable number.
1123410001013 is a deficient number, since it is larger than the sum of its proper divisors (46551406987).
1123410001013 is a wasteful number, since it uses less digits than its factorization.
1123410001013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 329092.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1123410001013 its reverse (3101000143211), we get a palindrome (4224410144224).
The spelling of 1123410001013 in words is "one trillion, one hundred twenty-three billion, four hundred ten million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •