Base | Representation |
---|---|
bin | 110001001100100111… |
… | …1111101000011110011 |
3 | 101002200221200220100201 |
4 | 1202121033331003303 |
5 | 3212332434431121 |
6 | 120311324500031 |
7 | 10430053554421 |
oct | 1423117750363 |
9 | 332627626321 |
10 | 105650311411 |
11 | 40895934757 |
12 | 185860aa617 |
13 | 9c69300c88 |
14 | 5183644111 |
15 | 2b352eae91 |
hex | 18993fd0f3 |
105650311411 has 4 divisors (see below), whose sum is σ = 105801025824. Its totient is φ = 105499597000.
The previous prime is 105650311397. The next prime is 105650311421. The reversal of 105650311411 is 114113056501.
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 105650311411 - 25 = 105650311379 is a prime.
It is a super-2 number, since 2×1056503114112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 105650311411.
It is not an unprimeable number, because it can be changed into a prime (105650311421) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 75356155 + ... + 75357556.
It is an arithmetic number, because the mean of its divisors is an integer number (26450256456).
Almost surely, 2105650311411 is an apocalyptic number.
105650311411 is a deficient number, since it is larger than the sum of its proper divisors (150714413).
105650311411 is an equidigital number, since it uses as much as digits as its factorization.
105650311411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150714412.
The product of its (nonzero) digits is 1800, while the sum is 28.
Adding to 105650311411 its reverse (114113056501), we get a palindrome (219763367912).
The spelling of 105650311411 in words is "one hundred five billion, six hundred fifty million, three hundred eleven thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •