Base | Representation |
---|---|
bin | 10100110000000001… |
… | …01010110110010100 |
3 | 1001202101100011212020 |
4 | 22120000222312110 |
5 | 140303400400212 |
6 | 5041234053140 |
7 | 543031352013 |
oct | 123000526624 |
9 | 31671304766 |
10 | 11140246932 |
11 | 47a7419451 |
12 | 21aaa1a1b0 |
13 | 1086cc01b9 |
14 | 77977aa7a |
15 | 453043d8c |
hex | 29802ad94 |
11140246932 has 12 divisors (see below), whose sum is σ = 25993909536. Its totient is φ = 3713415640.
The previous prime is 11140246921. The next prime is 11140246937. The reversal of 11140246932 is 23964204111.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 11140246893 and 11140246902.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11140246937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 464176944 + ... + 464176967.
It is an arithmetic number, because the mean of its divisors is an integer number (2166159128).
Almost surely, 211140246932 is an apocalyptic number.
11140246932 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11140246932 is an abundant number, since it is smaller than the sum of its proper divisors (14853662604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11140246932 is a wasteful number, since it uses less digits than its factorization.
11140246932 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 928353918 (or 928353916 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 33.
The spelling of 11140246932 in words is "eleven billion, one hundred forty million, two hundred forty-six thousand, nine hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •