Base | Representation |
---|---|
bin | 110001011101011100… |
… | …0010001110001000011 |
3 | 101011011021101011220202 |
4 | 1202322320101301003 |
5 | 3220011404430430 |
6 | 120443321555415 |
7 | 10450044416051 |
oct | 1427270216103 |
9 | 334137334822 |
10 | 106214530115 |
11 | 41055373601 |
12 | 18703045b6b |
13 | a02917c2b5 |
14 | 51d85551d1 |
15 | 2b69aebd45 |
hex | 18bae11c43 |
106214530115 has 8 divisors (see below), whose sum is σ = 131568966528. Its totient is φ = 82230603840.
The previous prime is 106214530091. The next prime is 106214530153. The reversal of 106214530115 is 511035412601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106214530115 - 228 = 105946094659 is a prime.
It is a super-2 number, since 2×1062145301152 (a number of 23 digits) contains 22 as substring.
It is a Duffinian 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 7 ways as a sum of consecutive naturals, for example, 342627362 + ... + 342627671.
It is an arithmetic number, because the mean of its divisors is an integer number (16446120816).
Almost surely, 2106214530115 is an apocalyptic number.
106214530115 is a deficient number, since it is larger than the sum of its proper divisors (25354436413).
106214530115 is an equidigital number, since it uses as much as digits as its factorization.
106214530115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 685255069.
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 106214530115 its reverse (511035412601), we get a palindrome (617249942716).
The spelling of 106214530115 in words is "one hundred six billion, two hundred fourteen million, five hundred thirty thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •