Base | Representation |
---|---|
bin | 110001011000101110… |
… | …1100011111011111011 |
3 | 101010202021002000211212 |
4 | 1202301131203323323 |
5 | 3214200433003312 |
6 | 120415515313335 |
7 | 10443115434230 |
oct | 1426135437373 |
9 | 333667060755 |
10 | 106056531707 |
11 | 40a84169005 |
12 | 1867a14b84b |
13 | a00250c909 |
14 | 51c1587787 |
15 | 2b5acdc822 |
hex | 18b1763efb |
106056531707 has 16 divisors (see below), whose sum is σ = 125425809600. Its totient is φ = 87743779200.
The previous prime is 106056531689. The next prime is 106056531731. The reversal of 106056531707 is 707135650601.
It is not a de Polignac number, because 106056531707 - 218 = 106056269563 is a prime.
It is a super-2 number, since 2×1060565317072 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106056531107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 590969 + ... + 749237.
It is an arithmetic number, because the mean of its divisors is an integer number (7839113100).
Almost surely, 2106056531707 is an apocalyptic number.
106056531707 is a deficient number, since it is larger than the sum of its proper divisors (19369277893).
106056531707 is a wasteful number, since it uses less digits than its factorization.
106056531707 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161606.
The product of its (nonzero) digits is 132300, while the sum is 41.
The spelling of 106056531707 in words is "one hundred six billion, fifty-six million, five hundred thirty-one thousand, seven hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •