Base | Representation |
---|---|
bin | 110001011101010110… |
… | …1101011000100000001 |
3 | 101011011002010221111220 |
4 | 1202322231223010001 |
5 | 3220010202001040 |
6 | 120443142225253 |
7 | 10450011660144 |
oct | 1427255530401 |
9 | 334132127456 |
10 | 106211750145 |
11 | 41053844a06 |
12 | 18702125229 |
13 | a028717b47 |
14 | 51d803005b |
15 | 2b6974d2d0 |
hex | 18bab6b101 |
106211750145 has 32 divisors (see below), whose sum is σ = 173371708800. Its totient is φ = 55508104704.
The previous prime is 106211750129. The next prime is 106211750167. The reversal of 106211750145 is 541057112601.
It is not a de Polignac number, because 106211750145 - 24 = 106211750129 is a prime.
It is a super-2 number, since 2×1062117501452 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 85291 + ... + 468719.
It is an arithmetic number, because the mean of its divisors is an integer number (5417865900).
Almost surely, 2106211750145 is an apocalyptic number.
106211750145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106211750145 is a deficient number, since it is larger than the sum of its proper divisors (67159958655).
106211750145 is a wasteful number, since it uses less digits than its factorization.
106211750145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383809.
The product of its (nonzero) digits is 8400, while the sum is 33.
Adding to 106211750145 its reverse (541057112601), we get a palindrome (647268862746).
The spelling of 106211750145 in words is "one hundred six billion, two hundred eleven million, seven hundred fifty thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •