Base | Representation |
---|---|
bin | 1011001111101001000001… |
… | …0010000100101000011000 |
3 | 1121202220221011212110020120 |
4 | 2303322100102010220120 |
5 | 3110030103123101202 |
6 | 42143345520553240 |
7 | 2414136001420503 |
oct | 263722022045030 |
9 | 47686834773216 |
10 | 12363336534552 |
11 | 3a37297186a33 |
12 | 1478120482820 |
13 | 6b8b1c2b0073 |
14 | 30a56278013a |
15 | 1668eac000bc |
hex | b3e90484a18 |
12363336534552 has 16 divisors (see below), whose sum is σ = 30908341336440. Its totient is φ = 4121112178176.
The previous prime is 12363336534469. The next prime is 12363336534559. The reversal of 12363336534552 is 25543563336321.
It is a junction number, because it is equal to n+sod(n) for n = 12363336534495 and 12363336534504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12363336534559) 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 3 ways as a sum of consecutive naturals, for example, 257569511113 + ... + 257569511160.
Almost surely, 212363336534552 is an apocalyptic number.
12363336534552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12363336534552 is an abundant number, since it is smaller than the sum of its proper divisors (18545004801888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12363336534552 is a wasteful number, since it uses less digits than its factorization.
12363336534552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 515139022282 (or 515139022278 counting only the distinct ones).
The product of its digits is 17496000, while the sum is 51.
The spelling of 12363336534552 in words is "twelve trillion, three hundred sixty-three billion, three hundred thirty-six million, five hundred thirty-four thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •