Base | Representation |
---|---|
bin | 110001100100100011… |
… | …1010110111001110100 |
3 | 101011202220210012212210 |
4 | 1203021013112321310 |
5 | 3221004030124330 |
6 | 120523133013420 |
7 | 10456004444541 |
oct | 1431107267164 |
9 | 334686705783 |
10 | 106453364340 |
11 | 41168170264 |
12 | 1876b024270 |
13 | a0667b261b |
14 | 521c165bc8 |
15 | 2b80a778b0 |
hex | 18c91d6e74 |
106453364340 has 24 divisors (see below), whose sum is σ = 298069420320. Its totient is φ = 28387563808.
The previous prime is 106453364333. The next prime is 106453364341. The reversal of 106453364340 is 43463354601.
It is a super-2 number, since 2×1064533643402 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106453364341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 887111310 + ... + 887111429.
It is an arithmetic number, because the mean of its divisors is an integer number (12419559180).
Almost surely, 2106453364340 is an apocalyptic number.
106453364340 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106453364340 is an abundant number, since it is smaller than the sum of its proper divisors (191616055980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106453364340 is a wasteful number, since it uses less digits than its factorization.
106453364340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1774222751 (or 1774222749 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 39.
The spelling of 106453364340 in words is "one hundred six billion, four hundred fifty-three million, three hundred sixty-four thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •