Base | Representation |
---|---|
bin | 110000100000110100010011… |
… | …010111101110100100001101 |
3 | 1000222110011002212212200021122 |
4 | 300200310103113232210031 |
5 | 210431203134312204131 |
6 | 2033440514151210325 |
7 | 62640565526014643 |
oct | 6040642327564415 |
9 | 1028404085780248 |
10 | 213361415350541 |
11 | 61a90082710197 |
12 | 1bb1aa563769a5 |
13 | 9208b837c78b3 |
14 | 3a98a675cb193 |
15 | 19a0047a10d7b |
hex | c20d135ee90d |
213361415350541 has 8 divisors (see below), whose sum is σ = 215751102438144. Its totient is φ = 210977847821520.
The previous prime is 213361415350513. The next prime is 213361415350607. The reversal of 213361415350541 is 145053514163312.
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 213361415350541 - 210 = 213361415349517 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 213361415350492 and 213361415350501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213361415250541) 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, 1529819525 + ... + 1529958986.
It is an arithmetic number, because the mean of its divisors is an integer number (26968887804768).
Almost surely, 2213361415350541 is an apocalyptic number.
It is an amenable number.
213361415350541 is a deficient number, since it is larger than the sum of its proper divisors (2389687087603).
213361415350541 is a wasteful number, since it uses less digits than its factorization.
213361415350541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3059779291.
The product of its (nonzero) digits is 648000, while the sum is 44.
The spelling of 213361415350541 in words is "two hundred thirteen trillion, three hundred sixty-one billion, four hundred fifteen million, three hundred fifty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •