Base | Representation |
---|---|
bin | 110000111010011100… |
… | …0111111101111011111 |
3 | 101001010102212210021111 |
4 | 1201310320333233133 |
5 | 3210110310011221 |
6 | 120131014242451 |
7 | 10405665634333 |
oct | 1416470775737 |
9 | 331112783244 |
10 | 105040313311 |
11 | 4060257809a |
12 | 18435956427 |
13 | 9b9cb1465b |
14 | 51266177c3 |
15 | 2aeb9a5be1 |
hex | 1874e3fbdf |
105040313311 has 4 divisors (see below), whose sum is σ = 105045333624. Its totient is φ = 105035293000.
The previous prime is 105040313309. The next prime is 105040313321. The reversal of 105040313311 is 113313040501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113313040501 = 31 ⋅3655259371.
It is a cyclic number.
It is not a de Polignac number, because 105040313311 - 21 = 105040313309 is a prime.
It is a super-2 number, since 2×1050403133112 (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 (105040313321) 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, 2478640 + ... + 2520661.
It is an arithmetic number, because the mean of its divisors is an integer number (26261333406).
Almost surely, 2105040313311 is an apocalyptic number.
105040313311 is a deficient number, since it is larger than the sum of its proper divisors (5020313).
105040313311 is an equidigital number, since it uses as much as digits as its factorization.
105040313311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5020312.
The product of its (nonzero) digits is 540, while the sum is 22.
Adding to 105040313311 its reverse (113313040501), we get a palindrome (218353353812).
The spelling of 105040313311 in words is "one hundred five billion, forty million, three hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •