Base | Representation |
---|---|
bin | 110001000101011101… |
… | …1011011100110000011 |
3 | 101002002012121101021001 |
4 | 1202022323123212003 |
5 | 3211334433103220 |
6 | 120231423112431 |
7 | 10421105434204 |
oct | 1421273334603 |
9 | 332065541231 |
10 | 105410050435 |
11 | 40782253068 |
12 | 18519742717 |
13 | 9c2b5bb411 |
14 | 515d7815ab |
15 | 2b1e18c80a |
hex | 188aedb983 |
105410050435 has 4 divisors (see below), whose sum is σ = 126492060528. Its totient is φ = 84328040344.
The previous prime is 105410050423. The next prime is 105410050441. The reversal of 105410050435 is 534050014501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 534050014501 = 2393 ⋅223171757.
It is a cyclic number.
It is not a de Polignac number, because 105410050435 - 227 = 105275832707 is a prime.
It is a super-2 number, since 2×1054100504352 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 10541005039 + ... + 10541005048.
It is an arithmetic number, because the mean of its divisors is an integer number (31623015132).
Almost surely, 2105410050435 is an apocalyptic number.
105410050435 is a deficient number, since it is larger than the sum of its proper divisors (21082010093).
105410050435 is an equidigital number, since it uses as much as digits as its factorization.
105410050435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21082010092.
The product of its (nonzero) digits is 6000, while the sum is 28.
Adding to 105410050435 its reverse (534050014501), we get a palindrome (639460064936).
The spelling of 105410050435 in words is "one hundred five billion, four hundred ten million, fifty thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.289 sec. • engine limits •