Base | Representation |
---|---|
bin | 1011011010001010011111… |
… | …1100010111000011010010 |
3 | 1122102012120102211212111022 |
4 | 2312202213330113003102 |
5 | 3121010330230404300 |
6 | 42402405023315442 |
7 | 2433166016520362 |
oct | 266424774270322 |
9 | 48365512755438 |
10 | 12544122122450 |
11 | 3aa6a28a05a06 |
12 | 14a717514bb82 |
13 | 6ccba08cc609 |
14 | 3151d2a329a2 |
15 | 16b47c385285 |
hex | b68a7f170d2 |
12544122122450 has 12 divisors (see below), whose sum is σ = 23332067147850. Its totient is φ = 5017648848960.
The previous prime is 12544122122423. The next prime is 12544122122479. The reversal of 12544122122450 is 5422122144521.
It can be written as a sum of positive squares in 3 ways, for example, as 6416185254361 + 6127936868089 = 2533019^2 + 2475467^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 12544122122450.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 125441221175 + ... + 125441221274.
Almost surely, 212544122122450 is an apocalyptic number.
12544122122450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12544122122450 is a deficient number, since it is larger than the sum of its proper divisors (10787945025400).
12544122122450 is a wasteful number, since it uses less digits than its factorization.
12544122122450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250882442461 (or 250882442456 counting only the distinct ones).
The product of its (nonzero) digits is 51200, while the sum is 35.
Adding to 12544122122450 its reverse (5422122144521), we get a palindrome (17966244266971).
The spelling of 12544122122450 in words is "twelve trillion, five hundred forty-four billion, one hundred twenty-two million, one hundred twenty-two thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •