Base | Representation |
---|---|
bin | 110001011001110010… |
… | …0111010000000000001 |
3 | 101010211201211121000001 |
4 | 1202303210322000001 |
5 | 3214234023332041 |
6 | 120423224000001 |
7 | 10444026135016 |
oct | 1426344720001 |
9 | 333751747001 |
10 | 106092011521 |
11 | 40aa21a1571 |
12 | 1868a000001 |
13 | a009982ba2 |
14 | 51c618170d |
15 | 2b5de9a131 |
hex | 18b393a001 |
106092011521 has 2 divisors, whose sum is σ = 106092011522. Its totient is φ = 106092011520.
The previous prime is 106092011491. The next prime is 106092011549. The reversal of 106092011521 is 125110290601.
It is an a-pointer prime, because the next prime (106092011549) can be obtained adding 106092011521 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 87048011521 + 19044000000 = 295039^2 + 138000^2 .
It is a cyclic number.
It is not a de Polignac number, because 106092011521 - 25 = 106092011489 is a prime.
It is a super-2 number, since 2×1060920115212 (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 106092011521.
It is not a weakly prime, because it can be changed into another prime (106092011591) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53046005760 + 53046005761.
It is an arithmetic number, because the mean of its divisors is an integer number (53046005761).
Almost surely, 2106092011521 is an apocalyptic number.
It is an amenable number.
106092011521 is a deficient number, since it is larger than the sum of its proper divisors (1).
106092011521 is an equidigital number, since it uses as much as digits as its factorization.
106092011521 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1080, while the sum is 28.
The spelling of 106092011521 in words is "one hundred six billion, ninety-two million, eleven thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •