Base | Representation |
---|---|
bin | 110001001001001100… |
… | …0100000111101110011 |
3 | 101002101220221022202112 |
4 | 1202102120200331303 |
5 | 3212113442140443 |
6 | 120252051435535 |
7 | 10424154451244 |
oct | 1422230407563 |
9 | 332356838675 |
10 | 105535115123 |
11 | 40836904009 |
12 | 185535b5bab |
13 | 9c4b4996a9 |
14 | 5172218ccb |
15 | 2b2a143b18 |
hex | 1892620f73 |
105535115123 has 4 divisors (see below), whose sum is σ = 105848276040. Its totient is φ = 105221954208.
The previous prime is 105535115053. The next prime is 105535115131. The reversal of 105535115123 is 321511535501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105535115123 is a prime.
It is a super-2 number, since 2×1055351151232 (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 105535115123.
It is not an unprimeable number, because it can be changed into a prime (105535114123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 156579953 + ... + 156580626.
It is an arithmetic number, because the mean of its divisors is an integer number (26462069010).
Almost surely, 2105535115123 is an apocalyptic number.
105535115123 is a deficient number, since it is larger than the sum of its proper divisors (313160917).
105535115123 is an equidigital number, since it uses as much as digits as its factorization.
105535115123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313160916.
The product of its (nonzero) digits is 11250, while the sum is 32.
The spelling of 105535115123 in words is "one hundred five billion, five hundred thirty-five million, one hundred fifteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •