Base | Representation |
---|---|
bin | 10110010111110001… |
… | …11011010101010100 |
3 | 1011000001010100102221 |
4 | 23023320323111110 |
5 | 144044210220112 |
6 | 5303445312124 |
7 | 603430456243 |
oct | 131370732524 |
9 | 34001110387 |
10 | 12010632532 |
11 | 5103763a98 |
12 | 23b2405644 |
13 | 1195418272 |
14 | 81d1c895a |
15 | 4a4670e07 |
hex | 2cbe3b554 |
12010632532 has 24 divisors (see below), whose sum is σ = 22258903464. Its totient is φ = 5651069952.
The previous prime is 12010632527. The next prime is 12010632541. The reversal of 12010632532 is 23523601021.
It can be written as a sum of positive squares in 4 ways, for example, as 8077335876 + 3933296656 = 89874^2 + 62716^2 .
It is a junction number, because it is equal to n+sod(n) for n = 12010632497 and 12010632506.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 499408 + ... + 522904.
It is an arithmetic number, because the mean of its divisors is an integer number (927454311).
Almost surely, 212010632532 is an apocalyptic number.
It is an amenable number.
12010632532 is a deficient number, since it is larger than the sum of its proper divisors (10248270932).
12010632532 is a wasteful number, since it uses less digits than its factorization.
12010632532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31035 (or 31033 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 25.
The spelling of 12010632532 in words is "twelve billion, ten million, six hundred thirty-two thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •