Base | Representation |
---|---|
bin | 11001011110010000011000… |
… | …010001101101000011011001 |
3 | 112200122222212121121211200212 |
4 | 121132100120101231003121 |
5 | 104141001111031234113 |
6 | 1034134005224540505 |
7 | 32411632056033143 |
oct | 3136203021550331 |
9 | 480588777554625 |
10 | 112030334243033 |
11 | 32772886067818 |
12 | 10694290321735 |
13 | 4a68552227a5b |
14 | 1d944233a3c93 |
15 | ce427583e0a8 |
hex | 65e41846d0d9 |
112030334243033 has 4 divisors (see below), whose sum is σ = 112030401365520. Its totient is φ = 112030267120548.
The previous prime is 112030334242973. The next prime is 112030334243053. The reversal of 112030334243033 is 330342433030211.
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 112030334243033 - 220 = 112030333194457 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112030334243053) 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, 30992123 + ... + 34417616.
It is an arithmetic number, because the mean of its divisors is an integer number (28007600341380).
Almost surely, 2112030334243033 is an apocalyptic number.
It is an amenable number.
112030334243033 is a deficient number, since it is larger than the sum of its proper divisors (67122487).
112030334243033 is an equidigital number, since it uses as much as digits as its factorization.
112030334243033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67122486.
The product of its (nonzero) digits is 46656, while the sum is 32.
Adding to 112030334243033 its reverse (330342433030211), we get a palindrome (442372767273244).
The spelling of 112030334243033 in words is "one hundred twelve trillion, thirty billion, three hundred thirty-four million, two hundred forty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •