Base | Representation |
---|---|
bin | 1001101001011010100010… |
… | …01110011000100011111111 |
3 | 2210010001120111122100112002 |
4 | 10310231101032120203333 |
5 | 10240033143241400223 |
6 | 113041401034532515 |
7 | 4316450543312552 |
oct | 464552116304377 |
9 | 83101514570462 |
10 | 21214206200063 |
11 | 683999238a538 |
12 | 246755689713b |
13 | bab64cb25986 |
14 | 534ab73b6699 |
15 | 26bc6bd35e28 |
hex | 134b513988ff |
21214206200063 has 4 divisors (see below), whose sum is σ = 21482740455840. Its totient is φ = 20945671944288.
The previous prime is 21214206200017. The next prime is 21214206200071. The reversal of 21214206200063 is 36000260241212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21214206200063 - 220 = 21214205151487 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21214206199999 and 21214206200035.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21214206200263) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 134267127770 + ... + 134267127927.
It is an arithmetic number, because the mean of its divisors is an integer number (5370685113960).
Almost surely, 221214206200063 is an apocalyptic number.
21214206200063 is a deficient number, since it is larger than the sum of its proper divisors (268534255777).
21214206200063 is an equidigital number, since it uses as much as digits as its factorization.
21214206200063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 268534255776.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 21214206200063 its reverse (36000260241212), we get a palindrome (57214466441275).
The spelling of 21214206200063 in words is "twenty-one trillion, two hundred fourteen billion, two hundred six million, two hundred thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •