Base | Representation |
---|---|
bin | 10000000101100000100… |
… | …010100011011000010111 |
3 | 10220200022001112121210121 |
4 | 100011200202203120113 |
5 | 121102403110444443 |
6 | 2203454213132411 |
7 | 142602331136641 |
oct | 20054042433027 |
9 | 3820261477717 |
10 | 1105426265623 |
11 | 396899343739 |
12 | 15a2a502a107 |
13 | 8031a043734 |
14 | 3b708009891 |
15 | 1db4c0584ed |
hex | 101608a3617 |
1105426265623 has 8 divisors (see below), whose sum is σ = 1116633563136. Its totient is φ = 1094228103000.
The previous prime is 1105426265479. The next prime is 1105426265689. The reversal of 1105426265623 is 3265626245011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1105426265623 - 217 = 1105426134551 is a prime.
It is a super-2 number, since 2×11054262656232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1105426265623.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1105426365623) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2040343 + ... + 2524648.
It is an arithmetic number, because the mean of its divisors is an integer number (139579195392).
Almost surely, 21105426265623 is an apocalyptic number.
1105426265623 is a deficient number, since it is larger than the sum of its proper divisors (11207297513).
1105426265623 is a wasteful number, since it uses less digits than its factorization.
1105426265623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4567445.
The product of its (nonzero) digits is 518400, while the sum is 43.
The spelling of 1105426265623 in words is "one trillion, one hundred five billion, four hundred twenty-six million, two hundred sixty-five thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •