Base | Representation |
---|---|
bin | 1100010010111110110010… |
… | …0100101111011111101110 |
3 | 1202212112002011011101200020 |
4 | 3010233230210233133232 |
5 | 3233003413132311324 |
6 | 44431035231143010 |
7 | 2563542634316406 |
oct | 304575444573756 |
9 | 52775064141606 |
10 | 13520231135214 |
11 | 4342997005551 |
12 | 162438a074a66 |
13 | 770c4c3499cb |
14 | 34a5500d9806 |
15 | 186a5b490679 |
hex | c4bec92f7ee |
13520231135214 has 8 divisors (see below), whose sum is σ = 27040462270440. Its totient is φ = 4506743711736.
The previous prime is 13520231135189. The next prime is 13520231135231. The reversal of 13520231135214 is 41253113202531.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
13520231135214 is an admirable number.
It is a super-2 number, since 2×135202311352142 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1126685927929 + ... + 1126685927940.
It is an arithmetic number, because the mean of its divisors is an integer number (3380057783805).
Almost surely, 213520231135214 is an apocalyptic number.
13520231135214 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13520231135214 is a wasteful number, since it uses less digits than its factorization.
13520231135214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2253371855874.
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 13520231135214 its reverse (41253113202531), we get a palindrome (54773344337745).
The spelling of 13520231135214 in words is "thirteen trillion, five hundred twenty billion, two hundred thirty-one million, one hundred thirty-five thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •