Base | Representation |
---|---|
bin | 110011011010001101… |
… | …0011100011001011111 |
3 | 101112222000222120021010 |
4 | 1212310122130121133 |
5 | 3302100124411333 |
6 | 122414552510303 |
7 | 10655561062365 |
oct | 1466432343137 |
9 | 345860876233 |
10 | 110401013343 |
11 | 429035483a5 |
12 | 194910ab393 |
13 | a5456047ca |
14 | 54b456d635 |
15 | 2d1240b563 |
hex | 19b469c65f |
110401013343 has 4 divisors (see below), whose sum is σ = 147201351128. Its totient is φ = 73600675560.
The previous prime is 110401013339. The next prime is 110401013347. The reversal of 110401013343 is 343310104011.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (110401013339) and next prime (110401013347).
It is not a de Polignac number, because 110401013343 - 22 = 110401013339 is a prime.
It is a super-2 number, since 2×1104010133432 (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 (110401013347) 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, 18400168888 + ... + 18400168893.
It is an arithmetic number, because the mean of its divisors is an integer number (36800337782).
Almost surely, 2110401013343 is an apocalyptic number.
110401013343 is a deficient number, since it is larger than the sum of its proper divisors (36800337785).
110401013343 is an equidigital number, since it uses as much as digits as its factorization.
110401013343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36800337784.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 110401013343 its reverse (343310104011), we get a palindrome (453711117354).
The spelling of 110401013343 in words is "one hundred ten billion, four hundred one million, thirteen thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •