Base | Representation |
---|---|
bin | 1001101001010100111101… |
… | …01100100110110100001101 |
3 | 2210002202211202122110222012 |
4 | 10310222132230212310031 |
5 | 10240011030004013401 |
6 | 113040143521231005 |
7 | 4316313403454222 |
oct | 464523654466415 |
9 | 83082752573865 |
10 | 21211211001101 |
11 | 68386956a91a0 |
12 | 2466a5b792465 |
13 | bab2934327b4 |
14 | 5348b169d949 |
15 | 26bb43dde8bb |
hex | 134a9eb26d0d |
21211211001101 has 8 divisors (see below), whose sum is σ = 23256962318304. Its totient is φ = 19185036251920.
The previous prime is 21211211001061. The next prime is 21211211001107. The reversal of 21211211001101 is 10110011211212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-21211211001101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21211211001107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4894139735 + ... + 4894144068.
It is an arithmetic number, because the mean of its divisors is an integer number (2907120289788).
Almost surely, 221211211001101 is an apocalyptic number.
It is an amenable number.
21211211001101 is a deficient number, since it is larger than the sum of its proper divisors (2045751317203).
21211211001101 is a wasteful number, since it uses less digits than its factorization.
21211211001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9788284011.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 21211211001101 its reverse (10110011211212), we get a palindrome (31321222212313).
The spelling of 21211211001101 in words is "twenty-one trillion, two hundred eleven billion, two hundred eleven million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •