Base | Representation |
---|---|
bin | 100000101001011100111… |
… | …111010000010000100100 |
3 | 21221110221200011210010021 |
4 | 200221130333100100210 |
5 | 243224223422422202 |
6 | 4434355334404524 |
7 | 321042560653261 |
oct | 40513477202044 |
9 | 7843850153107 |
10 | 2243533014052 |
11 | 795527996850 |
12 | 30298a800744 |
13 | 133744891255 |
14 | 7a832452268 |
15 | 3d55d1b7a37 |
hex | 20a5cfd0424 |
2243533014052 has 24 divisors (see below), whose sum is σ = 4284134235360. Its totient is φ = 1019543506560.
The previous prime is 2243533014017. The next prime is 2243533014053. The reversal of 2243533014052 is 2504103353422.
It is a junction number, because it is equal to n+sod(n) for n = 2243533013999 and 2243533014017.
It is not an unprimeable number, because it can be changed into a prime (2243533014053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5919802 + ... + 6287377.
It is an arithmetic number, because the mean of its divisors is an integer number (178505593140).
Almost surely, 22243533014052 is an apocalyptic number.
2243533014052 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2243533014052 is a deficient number, since it is larger than the sum of its proper divisors (2040601221308).
2243533014052 is a wasteful number, since it uses less digits than its factorization.
2243533014052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12211371 (or 12211369 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 34.
Adding to 2243533014052 its reverse (2504103353422), we get a palindrome (4747636367474).
The spelling of 2243533014052 in words is "two trillion, two hundred forty-three billion, five hundred thirty-three million, fourteen thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •