Base | Representation |
---|---|
bin | 110001001000010010… |
… | …1110100110111101101 |
3 | 101002022211100212021220 |
4 | 1202100211310313231 |
5 | 3212033243100333 |
6 | 120245055213553 |
7 | 10423341062142 |
oct | 1422045646755 |
9 | 332284325256 |
10 | 105505050093 |
11 | 40820939783 |
12 | 185455172b9 |
13 | 9c451a0c31 |
14 | 516c2303c9 |
15 | 2b276a58b3 |
hex | 1890974ded |
105505050093 has 8 divisors (see below), whose sum is σ = 146789635008. Its totient is φ = 67278582624.
The previous prime is 105505050083. The next prime is 105505050097. The reversal of 105505050093 is 390050505501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105505050093 - 217 = 105504919021 is a prime.
It is a super-2 number, since 2×1055050500932 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105505050097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 764529280 + ... + 764529417.
It is an arithmetic number, because the mean of its divisors is an integer number (18348704376).
Almost surely, 2105505050093 is an apocalyptic number.
It is an amenable number.
105505050093 is a deficient number, since it is larger than the sum of its proper divisors (41284584915).
105505050093 is a wasteful number, since it uses less digits than its factorization.
105505050093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1529058723.
The product of its (nonzero) digits is 16875, while the sum is 33.
Adding to 105505050093 its reverse (390050505501), we get a palindrome (495555555594).
The spelling of 105505050093 in words is "one hundred five billion, five hundred five million, fifty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •