Base | Representation |
---|---|
bin | 1010111101100011111110… |
… | …1010010000001011110000 |
3 | 1120200020020121111102110101 |
4 | 2233120333222100023300 |
5 | 3034433011021223040 |
6 | 41344542153442144 |
7 | 2352532200645421 |
oct | 257307752201360 |
9 | 46606217442411 |
10 | 12052746273520 |
11 | 39275a5069897 |
12 | 1427aa0410354 |
13 | 6957523c8214 |
14 | 2d94dad49648 |
15 | 15d7bd93b09a |
hex | af63fa902f0 |
12052746273520 has 40 divisors (see below), whose sum is σ = 28300086937440. Its totient is φ = 4773364857600.
The previous prime is 12052746273499. The next prime is 12052746273569. The reversal of 12052746273520 is 2537264725021.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (40).
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, 745830180 + ... + 745846339.
It is an arithmetic number, because the mean of its divisors is an integer number (707502173436).
Almost surely, 212052746273520 is an apocalyptic number.
12052746273520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12052746273520 is an abundant number, since it is smaller than the sum of its proper divisors (16247340663920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12052746273520 is a wasteful number, since it uses less digits than its factorization.
12052746273520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1491676633 (or 1491676627 counting only the distinct ones).
The product of its (nonzero) digits is 1411200, while the sum is 46.
The spelling of 12052746273520 in words is "twelve trillion, fifty-two billion, seven hundred forty-six million, two hundred seventy-three thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •