Base | Representation |
---|---|
bin | 1011001010010010100111… |
… | …1011110010111001110000 |
3 | 1121110010200201022002102101 |
4 | 2302210221323302321300 |
5 | 3102023334311334040 |
6 | 42033225340030144 |
7 | 2404403232233530 |
oct | 262445173627160 |
9 | 47403621262371 |
10 | 12271425105520 |
11 | 3a01311613a29 |
12 | 146234b532354 |
13 | 6b02624850b9 |
14 | 305d23a814c0 |
15 | 16431bb5909a |
hex | b2929ef2e70 |
12271425105520 has 40 divisors (see below), whose sum is σ = 32606929567584. Its totient is φ = 4207345750272.
The previous prime is 12271425105497. The next prime is 12271425105671. The reversal of 12271425105520 is 2550152417221.
It is a tau number, because it is divible by the number of its divisors (40).
It is a self number, because there is not a number n which added to its sum of digits gives 12271425105520.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 10956628999 + ... + 10956630118.
Almost surely, 212271425105520 is an apocalyptic number.
12271425105520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12271425105520 is an abundant number, since it is smaller than the sum of its proper divisors (20335504462064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12271425105520 is a wasteful number, since it uses less digits than its factorization.
12271425105520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21913259137 (or 21913259131 counting only the distinct ones).
The product of its (nonzero) digits is 56000, while the sum is 37.
The spelling of 12271425105520 in words is "twelve trillion, two hundred seventy-one billion, four hundred twenty-five million, one hundred five thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •