Base | Representation |
---|---|
bin | 10110001110011101… |
… | …11000111010010000 |
3 | 1010210121002222211100 |
4 | 23013032320322100 |
5 | 143414210104241 |
6 | 5252014544400 |
7 | 601461415341 |
oct | 130716707220 |
9 | 33717088740 |
10 | 11932503696 |
11 | 5073650703 |
12 | 2390208100 |
13 | 1182191799 |
14 | 812a8c0c8 |
15 | 49c88b9b6 |
hex | 2c73b8e90 |
11932503696 has 45 divisors (see below), whose sum is σ = 33398106339. Its totient is φ = 3977064288.
The previous prime is 11932503691. The next prime is 11932503721. The reversal of 11932503696 is 69630523911.
The square root of 11932503696 is 109236.
It is a perfect power (a square), and thus also a powerful number.
11932503696 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (11932503691) by changing a digit.
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 8 ways as a sum of consecutive naturals, for example, 1306281 + ... + 1315383.
Almost surely, 211932503696 is an apocalyptic number.
11932503696 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
11932503696 is the 109236-th square number.
It is an amenable number.
11932503696 is an abundant number, since it is smaller than the sum of its proper divisors (21465602643).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11932503696 is an frugal number, since it uses more digits than its factorization.
11932503696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18220 (or 9108 counting only the distinct ones).
The product of its (nonzero) digits is 262440, while the sum is 45.
The spelling of 11932503696 in words is "eleven billion, nine hundred thirty-two million, five hundred three thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •