Base | Representation |
---|---|
bin | 1100001110010101110011… |
… | …0101010001111110101111 |
3 | 1202120220022021001020202021 |
4 | 3003211130311101332233 |
5 | 3230202131043442320 |
6 | 44330252441411011 |
7 | 2555021241122665 |
oct | 303453465217657 |
9 | 52526267036667 |
10 | 13440510140335 |
11 | 43120a7643113 |
12 | 1610a3b799a67 |
13 | 766585c717a5 |
14 | 34674a42ac35 |
15 | 184942734daa |
hex | c395cd51faf |
13440510140335 has 8 divisors (see below), whose sum is σ = 16128652771440. Its totient is φ = 10752381043584.
The previous prime is 13440510140311. The next prime is 13440510140353. The reversal of 13440510140335 is 53304101504431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13440510140335 - 229 = 13439973269423 is a prime.
It is a super-2 number, since 2×134405101403352 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13440510140335.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1052890 + ... + 5290519.
It is an arithmetic number, because the mean of its divisors is an integer number (2016081596430).
Almost surely, 213440510140335 is an apocalyptic number.
13440510140335 is a deficient number, since it is larger than the sum of its proper divisors (2688142631105).
13440510140335 is an equidigital number, since it uses as much as digits as its factorization.
13440510140335 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6767177.
The product of its (nonzero) digits is 43200, while the sum is 34.
Adding to 13440510140335 its reverse (53304101504431), we get a palindrome (66744611644766).
The spelling of 13440510140335 in words is "thirteen trillion, four hundred forty billion, five hundred ten million, one hundred forty thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •