Base | Representation |
---|---|
bin | 11001000011111011100110… |
… | …101000000100000011111111 |
3 | 112110021001111022012021221201 |
4 | 121003323212220010003333 |
5 | 103421331230410341111 |
6 | 1030230550403440331 |
7 | 32134141026550204 |
oct | 3103734650040377 |
9 | 473231438167851 |
10 | 110221320012031 |
11 | 32135665756a48 |
12 | 104417690860a7 |
13 | 4966a975bbc67 |
14 | 1d30a51757cab |
15 | cb21997476c1 |
hex | 643ee6a040ff |
110221320012031 has 8 divisors (see below), whose sum is σ = 113777334720000. Its totient is φ = 106665335820120.
The previous prime is 110221320012029. The next prime is 110221320012053. The reversal of 110221320012031 is 130210023122011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110221320012031 - 21 = 110221320012029 is a prime.
It is a super-2 number, since 2×1102213200120312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110221320012931) 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, 172981 + ... + 14848318.
It is an arithmetic number, because the mean of its divisors is an integer number (14222166840000).
Almost surely, 2110221320012031 is an apocalyptic number.
110221320012031 is a deficient number, since it is larger than the sum of its proper divisors (3556014707969).
110221320012031 is a wasteful number, since it uses less digits than its factorization.
110221320012031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15258029.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 110221320012031 its reverse (130210023122011), we get a palindrome (240431343134042).
The spelling of 110221320012031 in words is "one hundred ten trillion, two hundred twenty-one billion, three hundred twenty million, twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •