Base | Representation |
---|---|
bin | 10000010110001010001… |
… | …001100010011001000000 |
3 | 10222101110000001211000022 |
4 | 100112022021202121000 |
5 | 121401011340021344 |
6 | 2220012215513012 |
7 | 144104345221364 |
oct | 20261211423100 |
9 | 3871400054008 |
10 | 1123304220224 |
11 | 3a3432a4762a |
12 | 161854388768 |
13 | 81c08bb20b4 |
14 | 3c5225472a4 |
15 | 1e3468550ee |
hex | 1058a262640 |
1123304220224 has 28 divisors (see below), whose sum is σ = 2276483558784. Its totient is φ = 549702063744.
The previous prime is 1123304220223. The next prime is 1123304220253. The reversal of 1123304220224 is 4220224033211.
It is a super-2 number, since 2×11233042202242 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1123304220193 and 1123304220202.
It is not an unprimeable number, because it can be changed into a prime (1123304220223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 186716444 + ... + 186722459.
Almost surely, 21123304220224 is an apocalyptic number.
It is an amenable number.
1123304220224 is an abundant number, since it is smaller than the sum of its proper divisors (1153179338560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1123304220224 is an equidigital number, since it uses as much as digits as its factorization.
1123304220224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373438962 (or 373438952 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 1123304220224 its reverse (4220224033211), we get a palindrome (5343528253435).
The spelling of 1123304220224 in words is "one trillion, one hundred twenty-three billion, three hundred four million, two hundred twenty thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •