Base | Representation |
---|---|
bin | 110011011010001011… |
… | …1111001000100010101 |
3 | 101112221222201120120021 |
4 | 1212310113321010111 |
5 | 3302044442004331 |
6 | 122414530305141 |
7 | 10655552305060 |
oct | 1466427710425 |
9 | 345858646507 |
10 | 110400344341 |
11 | 42903130801 |
12 | 19490a281b1 |
13 | a54542c151 |
14 | 54b44378d7 |
15 | 2d12328211 |
hex | 19b45f9115 |
110400344341 has 8 divisors (see below), whose sum is σ = 132812444480. Its totient is φ = 89648399808.
The previous prime is 110400344339. The next prime is 110400344347. The reversal of 110400344341 is 143443004011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110400344341 - 21 = 110400344339 is a prime.
It is a super-2 number, since 2×1104003443412 (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 (110400344347) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 415038756 + ... + 415039021.
It is an arithmetic number, because the mean of its divisors is an integer number (16601555560).
Almost surely, 2110400344341 is an apocalyptic number.
It is an amenable number.
110400344341 is a deficient number, since it is larger than the sum of its proper divisors (22412100139).
110400344341 is an equidigital number, since it uses as much as digits as its factorization.
110400344341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 830077803.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 110400344341 its reverse (143443004011), we get a palindrome (253843348352).
The spelling of 110400344341 in words is "one hundred ten billion, four hundred million, three hundred forty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •