Base | Representation |
---|---|
bin | 110100101011111101… |
… | …1010000001000000001 |
3 | 101211001012221222010212 |
4 | 1221113323100020001 |
5 | 3323204420100113 |
6 | 123551111003505 |
7 | 11113551452642 |
oct | 1512773201001 |
9 | 354035858125 |
10 | 113144300033 |
11 | 43a9100a286 |
12 | 19b17969595 |
13 | a891a65a7b |
14 | 5694a2d6c9 |
15 | 2e231920a8 |
hex | 1a57ed0201 |
113144300033 has 4 divisors (see below), whose sum is σ = 113152027860. Its totient is φ = 113136572208.
The previous prime is 113144299973. The next prime is 113144300069. The reversal of 113144300033 is 330003441311.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 96287951809 + 16856348224 = 310303^2 + 129832^2 .
It is a cyclic number.
It is not a de Polignac number, because 113144300033 - 212 = 113144295937 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113144299981 and 113144300008.
It is not an unprimeable number, because it can be changed into a prime (113144390033) 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, 3841910 + ... + 3871247.
It is an arithmetic number, because the mean of its divisors is an integer number (28288006965).
Almost surely, 2113144300033 is an apocalyptic number.
It is an amenable number.
113144300033 is a deficient number, since it is larger than the sum of its proper divisors (7727827).
113144300033 is an equidigital number, since it uses as much as digits as its factorization.
113144300033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7727826.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 113144300033 its reverse (330003441311), we get a palindrome (443147741344).
The spelling of 113144300033 in words is "one hundred thirteen billion, one hundred forty-four million, three hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •