Base | Representation |
---|---|
bin | 110000011101011010100101… |
… | …100001101111011111111111 |
3 | 1000221121210200222022020022222 |
4 | 300131122211201233133333 |
5 | 210413340403411414223 |
6 | 2033141253233155555 |
7 | 62614651464310136 |
oct | 6035324541573777 |
9 | 1027553628266288 |
10 | 213127644248063 |
11 | 619aaa20a51946 |
12 | 1baa16949bbbbb |
13 | 91bcb09a5645c |
14 | 3a8b60c2d291d |
15 | 1998e148540c8 |
hex | c1d6a586f7ff |
213127644248063 has 8 divisors (see below), whose sum is σ = 222597814425360. Its totient is φ = 203852735311680.
The previous prime is 213127644248027. The next prime is 213127644248107. The reversal of 213127644248063 is 360842446721312.
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 213127644248063 - 228 = 213127375812607 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 213127644247996 and 213127644248014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213127644242063) 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, 48815307998 + ... + 48815312363.
It is an arithmetic number, because the mean of its divisors is an integer number (27824726803170).
Almost surely, 2213127644248063 is an apocalyptic number.
213127644248063 is a deficient number, since it is larger than the sum of its proper divisors (9470170177297).
213127644248063 is an equidigital number, since it uses as much as digits as its factorization.
213127644248063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97630620457.
The product of its (nonzero) digits is 9289728, while the sum is 53.
The spelling of 213127644248063 in words is "two hundred thirteen trillion, one hundred twenty-seven billion, six hundred forty-four million, two hundred forty-eight thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •