Base | Representation |
---|---|
bin | 110010010101001011001001… |
… | …100001101011100011011101 |
3 | 1002000202120011012010010222220 |
4 | 302111023021201223203131 |
5 | 213003204431310111223 |
6 | 2102442104355255553 |
7 | 64424354602214040 |
oct | 6225131141534335 |
9 | 1060676135103886 |
10 | 221357405550813 |
11 | 6459316a726554 |
12 | 209b066b2aa5b9 |
13 | 9668bb574899c |
14 | 3c93a814c4c57 |
15 | 1a8d0329176e3 |
hex | c952c986b8dd |
221357405550813 has 8 divisors (see below), whose sum is σ = 337306522744128. Its totient is φ = 126489946029024.
The previous prime is 221357405550803. The next prime is 221357405550847. The reversal of 221357405550813 is 318055504753122.
221357405550813 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 221357405550813 - 29 = 221357405550301 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221357405550803) 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, 5270414417856 + ... + 5270414417897.
It is an arithmetic number, because the mean of its divisors is an integer number (42163315343016).
Almost surely, 2221357405550813 is an apocalyptic number.
It is an amenable number.
221357405550813 is a deficient number, since it is larger than the sum of its proper divisors (115949117193315).
221357405550813 is a wasteful number, since it uses less digits than its factorization.
221357405550813 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10540828835763.
The product of its (nonzero) digits is 5040000, while the sum is 51.
The spelling of 221357405550813 in words is "two hundred twenty-one trillion, three hundred fifty-seven billion, four hundred five million, five hundred fifty thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •