Base | Representation |
---|---|
bin | 110001100011011101… |
… | …0100100000010111111 |
3 | 101011200100100001222110 |
4 | 1203012322210002333 |
5 | 3220420103041441 |
6 | 120515333545103 |
7 | 10455045643635 |
oct | 1430672440277 |
9 | 334610301873 |
10 | 106416455871 |
11 | 411493513a0 |
12 | 1875a7a5193 |
13 | a05bc5bcab |
14 | 52172b9355 |
15 | 2b7c6d6b16 |
hex | 18c6ea40bf |
106416455871 has 16 divisors (see below), whose sum is σ = 155145070080. Its totient is φ = 64345864320.
The previous prime is 106416455863. The next prime is 106416455917. The reversal of 106416455871 is 178554614601.
It is not a de Polignac number, because 106416455871 - 23 = 106416455863 is a prime.
It is a super-2 number, since 2×1064164558712 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106416455871.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106416450871) 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 15 ways as a sum of consecutive naturals, for example, 3709431 + ... + 3738008.
It is an arithmetic number, because the mean of its divisors is an integer number (9696566880).
Almost surely, 2106416455871 is an apocalyptic number.
106416455871 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
106416455871 is a deficient number, since it is larger than the sum of its proper divisors (48728614209).
106416455871 is a wasteful number, since it uses less digits than its factorization.
106416455871 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7447886.
The product of its (nonzero) digits is 806400, while the sum is 48.
The spelling of 106416455871 in words is "one hundred six billion, four hundred sixteen million, four hundred fifty-five thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •