Base | Representation |
---|---|
bin | 110001011001110010… |
… | …0111001111111111111 |
3 | 101010211201211120222222 |
4 | 1202303210321333333 |
5 | 3214234023332034 |
6 | 120423223555555 |
7 | 10444026135014 |
oct | 1426344717777 |
9 | 333751746888 |
10 | 106092011519 |
11 | 40aa21a156a |
12 | 18689bbbbbb |
13 | a009982ba0 |
14 | 51c618170b |
15 | 2b5de9a12e |
hex | 18b3939fff |
106092011519 has 8 divisors (see below), whose sum is σ = 119220454752. Its totient is φ = 93673213920.
The previous prime is 106092011491. The next prime is 106092011521. The reversal of 106092011519 is 915110290601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-106092011519 is a prime.
It is a super-2 number, since 2×1060920115192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106092011549) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 177411092 + ... + 177411689.
It is an arithmetic number, because the mean of its divisors is an integer number (14902556844).
Almost surely, 2106092011519 is an apocalyptic number.
106092011519 is a deficient number, since it is larger than the sum of its proper divisors (13128443233).
106092011519 is a wasteful number, since it uses less digits than its factorization.
106092011519 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 354822817.
The product of its (nonzero) digits is 4860, while the sum is 35.
The spelling of 106092011519 in words is "one hundred six billion, ninety-two million, eleven thousand, five hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •