Base | Representation |
---|---|
bin | 10111010101111111… |
… | …01101000000011100 |
3 | 1012100102010002112100 |
4 | 23222333231000130 |
5 | 201131310040211 |
6 | 5431331005100 |
7 | 622365341220 |
oct | 135277550034 |
9 | 35312102470 |
10 | 12532502556 |
11 | 53512a8732 |
12 | 2519139790 |
13 | 12495899b2 |
14 | 86c634780 |
15 | 4d53a9156 |
hex | 2eafed01c |
12532502556 has 72 divisors (see below), whose sum is σ = 37372934144. Its totient is φ = 3465205920.
The previous prime is 12532502551. The next prime is 12532502557. The reversal of 12532502556 is 65520523521.
12532502556 is a `hidden beast` number, since 1 + 2 + 53 + 2 + 50 + 2 + 556 = 666.
It is a super-2 number, since 2×125325025562 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 12532502556.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12532502551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 794320 + ... + 809943.
Almost surely, 212532502556 is an apocalyptic number.
It is an amenable number.
12532502556 is an abundant number, since it is smaller than the sum of its proper divisors (24840431588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12532502556 is a wasteful number, since it uses less digits than its factorization.
12532502556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1604311 (or 1604306 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 36.
The spelling of 12532502556 in words is "twelve billion, five hundred thirty-two million, five hundred two thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •