Base | Representation |
---|---|
bin | 11001101111100111101001… |
… | …000001001110110100000000 |
3 | 112211220001202100002200212210 |
4 | 121233213221001032310000 |
5 | 104320023303312212000 |
6 | 1040450102142422120 |
7 | 32564062633146522 |
oct | 3157475101166400 |
9 | 484801670080783 |
10 | 113223542304000 |
11 | 3309291a998557 |
12 | 10847593291940 |
13 | 4b23c1b656c0b |
14 | 1dd6097851a12 |
15 | d1530e10d350 |
hex | 66f9e904ed00 |
113223542304000 has 144 divisors (see below), whose sum is σ = 376071996081600. Its totient is φ = 30192944588800.
The previous prime is 113223542303969. The next prime is 113223542304023. The reversal of 113223542304000 is 403245322311.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 589609950 + ... + 589801949.
It is an arithmetic number, because the mean of its divisors is an integer number (2611611083900).
Almost surely, 2113223542304000 is an apocalyptic number.
113223542304000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113223542304000 is an abundant number, since it is smaller than the sum of its proper divisors (262848453777600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113223542304000 is an equidigital number, since it uses as much as digits as its factorization.
113223542304000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1179411933 (or 1179411909 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 113223542304000 its reverse (403245322311), we get a palindrome (113626787626311).
The spelling of 113223542304000 in words is "one hundred thirteen trillion, two hundred twenty-three billion, five hundred forty-two million, three hundred four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •