Base | Representation |
---|---|
bin | 11001101111100111010111… |
… | …110110010111100001110001 |
3 | 112211220001000021001201002012 |
4 | 121233213113312113201301 |
5 | 104320022211041242231 |
6 | 1040450013412332305 |
7 | 32564052534525026 |
oct | 3157472766274161 |
9 | 484801007051065 |
10 | 113223254243441 |
11 | 33092792329381 |
12 | 10847512914095 |
13 | 4b23ba3a79694 |
14 | 1dd606b4a954d |
15 | d152e3babe2b |
hex | 66f9d7d97871 |
113223254243441 has 8 divisors (see below), whose sum is σ = 116890715789568. Its totient is φ = 109556736354000.
The previous prime is 113223254243383. The next prime is 113223254243453. The reversal of 113223254243441 is 144342452322311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113223254243441 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113223254243471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 235670315 + ... + 236150256.
It is an arithmetic number, because the mean of its divisors is an integer number (14611339473696).
Almost surely, 2113223254243441 is an apocalyptic number.
It is an amenable number.
113223254243441 is a deficient number, since it is larger than the sum of its proper divisors (3667461546127).
113223254243441 is an equidigital number, since it uses as much as digits as its factorization.
113223254243441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 471828343.
The product of its digits is 552960, while the sum is 41.
The spelling of 113223254243441 in words is "one hundred thirteen trillion, two hundred twenty-three billion, two hundred fifty-four million, two hundred forty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •