Base | Representation |
---|---|
bin | 1010111100010011010110… |
… | …0000111011100011101101 |
3 | 1120121011101010111211112021 |
4 | 2233010311200323203231 |
5 | 3034104143403033401 |
6 | 41331002301110141 |
7 | 2351134622021344 |
oct | 257046540734355 |
9 | 46534333454467 |
10 | 12031101221101 |
11 | 39193a7a97616 |
12 | 142385b558351 |
13 | 6936b2c723b1 |
14 | 2d84463a2b5b |
15 | 15ce535722a1 |
hex | af13583b8ed |
12031101221101 has 4 divisors (see below), whose sum is σ = 12037848896032. Its totient is φ = 12024353546172.
The previous prime is 12031101221093. The next prime is 12031101221123. The reversal of 12031101221101 is 10112210113021.
It is a happy number.
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 12031101221101 - 23 = 12031101221093 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 (12031101221141) 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, 3373834791 + ... + 3373838356.
It is an arithmetic number, because the mean of its divisors is an integer number (3009462224008).
Almost surely, 212031101221101 is an apocalyptic number.
It is an amenable number.
12031101221101 is a deficient number, since it is larger than the sum of its proper divisors (6747674931).
12031101221101 is an equidigital number, since it uses as much as digits as its factorization.
12031101221101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6747674930.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 12031101221101 its reverse (10112210113021), we get a palindrome (22143311334122).
The spelling of 12031101221101 in words is "twelve trillion, thirty-one billion, one hundred one million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •