Base | Representation |
---|---|
bin | 1101011101010010101… |
… | …0001101110010101101 |
3 | 211002202210122221110121 |
4 | 3113110222031302231 |
5 | 12241444440244041 |
6 | 254113510004541 |
7 | 22463243643640 |
oct | 3272452156255 |
9 | 732683587417 |
10 | 231201103021 |
11 | 8a062aa4759 |
12 | 38984946751 |
13 | 18a574a3805 |
14 | b293c65a57 |
15 | 60327557d1 |
hex | 35d4a8dcad |
231201103021 has 4 divisors (see below), whose sum is σ = 264229832032. Its totient is φ = 198172374012.
The previous prime is 231201103019. The next prime is 231201103051. The reversal of 231201103021 is 120301102132.
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 not a de Polignac number, because 231201103021 - 21 = 231201103019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 231201102986 and 231201103004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231201103051) 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, 16514364495 + ... + 16514364508.
It is an arithmetic number, because the mean of its divisors is an integer number (66057458008).
Almost surely, 2231201103021 is an apocalyptic number.
It is an amenable number.
231201103021 is a deficient number, since it is larger than the sum of its proper divisors (33028729011).
231201103021 is an equidigital number, since it uses as much as digits as its factorization.
231201103021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33028729010.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 231201103021 its reverse (120301102132), we get a palindrome (351502205153).
The spelling of 231201103021 in words is "two hundred thirty-one billion, two hundred one million, one hundred three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •