Base | Representation |
---|---|
bin | 1001100110000110011000… |
… | …11110111111001100110001 |
3 | 2202201011120212220120222122 |
4 | 10303003030132333030301 |
5 | 10231201413332030301 |
6 | 112513203144444025 |
7 | 4305306232004210 |
oct | 463031436771461 |
9 | 82634525816878 |
10 | 21100310033201 |
11 | 67a5655a25613 |
12 | 244946b179615 |
13 | ba099b3907b9 |
14 | 52d39098b077 |
15 | 268d02b7881b |
hex | 1330cc7bf331 |
21100310033201 has 8 divisors (see below), whose sum is σ = 24114812577024. Its totient is φ = 18085850624160.
The previous prime is 21100310033183. The next prime is 21100310033261. The reversal of 21100310033201 is 10233001300112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21100310033201 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21100310033201.
It is not an unprimeable number, because it can be changed into a prime (21100310033261) 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, 9728585 + ... + 11698118.
It is an arithmetic number, because the mean of its divisors is an integer number (3014351572128).
Almost surely, 221100310033201 is an apocalyptic number.
It is an amenable number.
21100310033201 is a deficient number, since it is larger than the sum of its proper divisors (3014502543823).
21100310033201 is a wasteful number, since it uses less digits than its factorization.
21100310033201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21567391.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 21100310033201 its reverse (10233001300112), we get a palindrome (31333311333313).
The spelling of 21100310033201 in words is "twenty-one trillion, one hundred billion, three hundred ten million, thirty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •