Base | Representation |
---|---|
bin | 1110100110001111011111… |
… | …01001110100101001111101 |
3 | 11012122202111212222201010012 |
4 | 13103013233221310221331 |
5 | 13201412414144234323 |
6 | 152134402431553005 |
7 | 6522112432143632 |
oct | 723075751645175 |
9 | 135582455881105 |
10 | 32100311321213 |
11 | a2567359841a3 |
12 | 372530938b765 |
13 | 14bb07ab45b95 |
14 | 7cd94037a189 |
15 | 3aa0094d9678 |
hex | 1d31efa74a7d |
32100311321213 has 4 divisors (see below), whose sum is σ = 32131446444768. Its totient is φ = 32069176197660.
The previous prime is 32100311321171. The next prime is 32100311321233. The reversal of 32100311321213 is 31212311300123.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32100311321213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32100311321233) 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, 15567560231 + ... + 15567562292.
It is an arithmetic number, because the mean of its divisors is an integer number (8032861611192).
Almost surely, 232100311321213 is an apocalyptic number.
It is an amenable number.
32100311321213 is a deficient number, since it is larger than the sum of its proper divisors (31135123555).
32100311321213 is a wasteful number, since it uses less digits than its factorization.
32100311321213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31135123554.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 32100311321213 its reverse (31212311300123), we get a palindrome (63312622621336).
The spelling of 32100311321213 in words is "thirty-two trillion, one hundred billion, three hundred eleven million, three hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •