Base | Representation |
---|---|
bin | 11001101111011100111011… |
… | …000000110001011000110101 |
3 | 112211211222001020100011010220 |
4 | 121233130323000301120311 |
5 | 104314331220422411201 |
6 | 1040440520122404553 |
7 | 32563204500613245 |
oct | 3157347300613065 |
9 | 484758036304126 |
10 | 113212033013301 |
11 | 33088a54228062 |
12 | 10845300960759 |
13 | 4b22b06073731 |
14 | 1dd56c508bb25 |
15 | d14d889bd036 |
hex | 66f73b031635 |
113212033013301 has 4 divisors (see below), whose sum is σ = 150949377351072. Its totient is φ = 75474688675532.
The previous prime is 113212033013267. The next prime is 113212033013309. The reversal of 113212033013301 is 103310330212311.
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 113212033013301 - 27 = 113212033013173 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113212033013309) 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, 18868672168881 + ... + 18868672168886.
It is an arithmetic number, because the mean of its divisors is an integer number (37737344337768).
Almost surely, 2113212033013301 is an apocalyptic number.
It is an amenable number.
113212033013301 is a deficient number, since it is larger than the sum of its proper divisors (37737344337771).
113212033013301 is an equidigital number, since it uses as much as digits as its factorization.
113212033013301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37737344337770.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 113212033013301 its reverse (103310330212311), we get a palindrome (216522363225612).
The spelling of 113212033013301 in words is "one hundred thirteen trillion, two hundred twelve billion, thirty-three million, thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •