Base | Representation |
---|---|
bin | 1100010010011100100011… |
… | …0010001011001111000111 |
3 | 1202211122100122211001202002 |
4 | 3010213020302023033013 |
5 | 3232331102412223333 |
6 | 44422515245135515 |
7 | 2563066120263164 |
oct | 304471062131707 |
9 | 52748318731662 |
10 | 13511040742343 |
11 | 433a0002a3341 |
12 | 162264425a59b |
13 | 7701162c7211 |
14 | 349d1b6c306b |
15 | 1866be7060e8 |
hex | c49c8c8b3c7 |
13511040742343 has 8 divisors (see below), whose sum is σ = 13541700168576. Its totient is φ = 13480382039800.
The previous prime is 13511040742333. The next prime is 13511040742387. The reversal of 13511040742343 is 34324704011531.
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 13511040742343 - 216 = 13511040676807 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13511040742297 and 13511040742306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13511040742333) 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, 59377358 + ... + 59604468.
It is an arithmetic number, because the mean of its divisors is an integer number (1692712521072).
Almost surely, 213511040742343 is an apocalyptic number.
13511040742343 is a deficient number, since it is larger than the sum of its proper divisors (30659426233).
13511040742343 is a wasteful number, since it uses less digits than its factorization.
13511040742343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 361845.
The product of its (nonzero) digits is 120960, while the sum is 38.
Adding to 13511040742343 its reverse (34324704011531), we get a palindrome (47835744753874).
The spelling of 13511040742343 in words is "thirteen trillion, five hundred eleven billion, forty million, seven hundred forty-two thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •