Base | Representation |
---|---|
bin | 110001000011011110… |
… | …1100011111101110111 |
3 | 101001220120101021102201 |
4 | 1202012331203331313 |
5 | 3211220414001101 |
6 | 120221044445331 |
7 | 10416336656101 |
oct | 1420675437567 |
9 | 331816337381 |
10 | 105343500151 |
11 | 4074872892a |
12 | 184bb3a9847 |
13 | 9c1a889b56 |
14 | 51549ba571 |
15 | 2b183e3e01 |
hex | 1886f63f77 |
105343500151 has 8 divisors (see below), whose sum is σ = 107609088384. Its totient is φ = 103101635640.
The previous prime is 105343500121. The next prime is 105343500167. The reversal of 105343500151 is 151005343501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105343500151 - 223 = 105335111543 is a prime.
It is a super-2 number, since 2×1053435001512 (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 (105343500121) 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 7 ways as a sum of consecutive naturals, for example, 5921955 + ... + 5939716.
It is an arithmetic number, because the mean of its divisors is an integer number (13451136048).
Almost surely, 2105343500151 is an apocalyptic number.
105343500151 is a deficient number, since it is larger than the sum of its proper divisors (2265588233).
105343500151 is a wasteful number, since it uses less digits than its factorization.
105343500151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11861861.
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 105343500151 its reverse (151005343501), we get a palindrome (256348843652).
The spelling of 105343500151 in words is "one hundred five billion, three hundred forty-three million, five hundred thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •