Base | Representation |
---|---|
bin | 1001100110000110011011… |
… | …01111110001110111000111 |
3 | 2202201011122100202121011011 |
4 | 10303003031233301313013 |
5 | 10231201434242242411 |
6 | 112513205222423051 |
7 | 4305306610013515 |
oct | 463031557616707 |
9 | 82634570677134 |
10 | 21100331212231 |
11 | 67a5666980747 |
12 | 2449476291a87 |
13 | ba09a289777b |
14 | 52d3937014b5 |
15 | 268d0495dc21 |
hex | 1330cdbf1dc7 |
21100331212231 has 8 divisors (see below), whose sum is σ = 21164503904928. Its totient is φ = 21036216000000.
The previous prime is 21100331212229. The next prime is 21100331212253. The reversal of 21100331212231 is 13221213300112.
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 21100331212231 - 21 = 21100331212229 is a prime.
It is a super-2 number, since 2×211003312122312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21100331212291) 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, 13634770 + ... + 15103231.
It is an arithmetic number, because the mean of its divisors is an integer number (2645562988116).
Almost surely, 221100331212231 is an apocalyptic number.
21100331212231 is a deficient number, since it is larger than the sum of its proper divisors (64172692697).
21100331212231 is a wasteful number, since it uses less digits than its factorization.
21100331212231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28740233.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 21100331212231 its reverse (13221213300112), we get a palindrome (34321544512343).
The spelling of 21100331212231 in words is "twenty-one trillion, one hundred billion, three hundred thirty-one million, two hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •