Base | Representation |
---|---|
bin | 10000000110010110001… |
… | …100011101010110110000 |
3 | 10220202121210101101121202 |
4 | 100012112030131112300 |
5 | 121111224032142230 |
6 | 2204123411110332 |
7 | 142633541416031 |
oct | 20062614352660 |
9 | 3822553341552 |
10 | 1106326443440 |
11 | 397210487649 |
12 | 15a4b65a23a8 |
13 | 804316a002a |
14 | 3b7917b0a88 |
15 | 1dba10bca45 |
hex | 1019631d5b0 |
1106326443440 has 20 divisors (see below), whose sum is σ = 2572208981184. Its totient is φ = 442530577344.
The previous prime is 1106326443379. The next prime is 1106326443449. The reversal of 1106326443440 is 443446236011.
It is a tau number, because it is divible by the number of its divisors (20).
It is a junction number, because it is equal to n+sod(n) for n = 1106326443394 and 1106326443403.
It is not an unprimeable number, because it can be changed into a prime (1106326443449) 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 in 3 ways as a sum of consecutive naturals, for example, 6914540192 + ... + 6914540351.
Almost surely, 21106326443440 is an apocalyptic number.
1106326443440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1106326443440 is an abundant number, since it is smaller than the sum of its proper divisors (1465882537744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1106326443440 is a wasteful number, since it uses less digits than its factorization.
1106326443440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13829080556 (or 13829080550 counting only the distinct ones).
The product of its (nonzero) digits is 165888, while the sum is 38.
The spelling of 1106326443440 in words is "one trillion, one hundred six billion, three hundred twenty-six million, four hundred forty-three thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •