Base | Representation |
---|---|
bin | 11000001101110110100111… |
… | …000010100010100110101011 |
3 | 111222002210021222211212112111 |
4 | 120031312213002202212223 |
5 | 102424434424231000021 |
6 | 1014303434231023151 |
7 | 31301511553104202 |
oct | 3015664702424653 |
9 | 458083258755474 |
10 | 106505106500011 |
11 | 30a3262004506a |
12 | bb414a080aab7 |
13 | 475750856063b |
14 | 1c42c360ca239 |
15 | c4a69782c8e1 |
hex | 60dda70a29ab |
106505106500011 has 4 divisors (see below), whose sum is σ = 107788300554312. Its totient is φ = 105221912445712.
The previous prime is 106505106499997. The next prime is 106505106500017. The reversal of 106505106500011 is 110005601505601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 106505106500011 - 29 = 106505106499499 is a prime.
It is a super-2 number, since 2×1065051065000112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106505106500017) 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 3 ways as a sum of consecutive naturals, for example, 641597027026 + ... + 641597027191.
It is an arithmetic number, because the mean of its divisors is an integer number (26947075138578).
Almost surely, 2106505106500011 is an apocalyptic number.
106505106500011 is a deficient number, since it is larger than the sum of its proper divisors (1283194054301).
106505106500011 is an equidigital number, since it uses as much as digits as its factorization.
106505106500011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1283194054300.
The product of its (nonzero) digits is 4500, while the sum is 31.
The spelling of 106505106500011 in words is "one hundred six trillion, five hundred five billion, one hundred six million, five hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •