Base | Representation |
---|---|
bin | 1011111011001000000011… |
… | …1110110101110011001111 |
3 | 1201102100020121101011110021 |
4 | 2332302000332311303033 |
5 | 3204300101430104320 |
6 | 43514500404323011 |
7 | 2522124015344251 |
oct | 276620076656317 |
9 | 51370217334407 |
10 | 13110404144335 |
11 | 41a5100396493 |
12 | 1578a739a3467 |
13 | 7413c8b18084 |
14 | 334792b6bcd1 |
15 | 17b071eb0daa |
hex | bec80fb5ccf |
13110404144335 has 8 divisors (see below), whose sum is σ = 15752475428976. Its totient is φ = 10474996344960.
The previous prime is 13110404144333. The next prime is 13110404144377. The reversal of 13110404144335 is 53344140401131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13110404144335 - 21 = 13110404144333 is a prime.
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 13110404144335.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110404144333) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1665866986 + ... + 1665874855.
It is an arithmetic number, because the mean of its divisors is an integer number (1969059428622).
Almost surely, 213110404144335 is an apocalyptic number.
13110404144335 is a deficient number, since it is larger than the sum of its proper divisors (2642071284641).
13110404144335 is an equidigital number, since it uses as much as digits as its factorization.
13110404144335 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3331742633.
The product of its (nonzero) digits is 34560, while the sum is 34.
Adding to 13110404144335 its reverse (53344140401131), we get a palindrome (66454544545466).
The spelling of 13110404144335 in words is "thirteen trillion, one hundred ten billion, four hundred four million, one hundred forty-four thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.164 sec. • engine limits •