Base | Representation |
---|---|
bin | 1110100110010100111011… |
… | …01000100000100000000101 |
3 | 11012200001001022101201200010 |
4 | 13103022131220200200011 |
5 | 13201434403413241401 |
6 | 152140004221540433 |
7 | 6522244654253616 |
oct | 723123550404005 |
9 | 135601038351603 |
10 | 32103230212101 |
11 | a2579a3586114 |
12 | 37259a2a14719 |
13 | 14bb42479c259 |
14 | 7cdb39cabc0d |
15 | 3aa12a8aaed6 |
hex | 1d329da20805 |
32103230212101 has 4 divisors (see below), whose sum is σ = 42804306949472. Its totient is φ = 21402153474732.
The previous prime is 32103230212061. The next prime is 32103230212103. The reversal of 32103230212101 is 10121203230123.
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 not a de Polignac number, because 32103230212101 - 217 = 32103230081029 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32103230212103) 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, 5350538368681 + ... + 5350538368686.
It is an arithmetic number, because the mean of its divisors is an integer number (10701076737368).
Almost surely, 232103230212101 is an apocalyptic number.
It is an amenable number.
32103230212101 is a deficient number, since it is larger than the sum of its proper divisors (10701076737371).
32103230212101 is a wasteful number, since it uses less digits than its factorization.
32103230212101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10701076737370.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 32103230212101 its reverse (10121203230123), we get a palindrome (42224433442224).
The spelling of 32103230212101 in words is "thirty-two trillion, one hundred three billion, two hundred thirty million, two hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •