Base | Representation |
---|---|
bin | 10100111111101101… |
… | …00111100110111110 |
3 | 1002002112221021211100 |
4 | 22133312213212332 |
5 | 141041042024300 |
6 | 5102254233530 |
7 | 546216654663 |
oct | 123766474676 |
9 | 32075837740 |
10 | 11271829950 |
11 | 4864721747 |
12 | 2226ab58a6 |
13 | 10a8341384 |
14 | 78d02da6a |
15 | 45e886700 |
hex | 29fda79be |
11271829950 has 36 divisors (see below), whose sum is σ = 30283651008. Its totient is φ = 3005821200.
The previous prime is 11271829937. The next prime is 11271829973. The reversal of 11271829950 is 5992817211.
It is a super-3 number, since 3×112718299503 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 11271829896 and 11271829905.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 12523806 + ... + 12524705.
It is an arithmetic number, because the mean of its divisors is an integer number (841212528).
Almost surely, 211271829950 is an apocalyptic number.
11271829950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11271829950 is an abundant number, since it is smaller than the sum of its proper divisors (19011821058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11271829950 is a wasteful number, since it uses less digits than its factorization.
11271829950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25048529 (or 25048521 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 45.
The spelling of 11271829950 in words is "eleven billion, two hundred seventy-one million, eight hundred twenty-nine thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •