Base | Representation |
---|---|
bin | 10101010010100111… |
… | …11010100100011100 |
3 | 1002111121111210201010 |
4 | 22221103322210130 |
5 | 141402202122412 |
6 | 5130123215220 |
7 | 553154454453 |
oct | 125123724434 |
9 | 32447453633 |
10 | 11430504732 |
11 | 4936249429 |
12 | 2270077510 |
13 | 110218988a |
14 | 7a6135b9a |
15 | 46d77b33c |
hex | 2a94fa91c |
11430504732 has 24 divisors (see below), whose sum is σ = 26672934400. Its totient is φ = 3809917296.
The previous prime is 11430504689. The next prime is 11430504749. The reversal of 11430504732 is 23740503411.
It is a happy number.
11430504732 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×114305047323 (a number of 31 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11430504732.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 290619 + ... + 327597.
Almost surely, 211430504732 is an apocalyptic number.
11430504732 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11430504732 is an abundant number, since it is smaller than the sum of its proper divisors (15242429668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11430504732 is a wasteful number, since it uses less digits than its factorization.
11430504732 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62745 (or 62743 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 30.
The spelling of 11430504732 in words is "eleven billion, four hundred thirty million, five hundred four thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •