Base | Representation |
---|---|
bin | 10101010111011101… |
… | …00100100110001010 |
3 | 1002121102210120022110 |
4 | 22223232210212022 |
5 | 141443042001200 |
6 | 5134132203150 |
7 | 554156201601 |
oct | 125356444612 |
9 | 32542716273 |
10 | 11471047050 |
11 | 495711a481 |
12 | 22817694b6 |
13 | 110a6b3208 |
14 | 7ab68aa38 |
15 | 4720d8b50 |
hex | 2abba498a |
11471047050 has 48 divisors (see below), whose sum is σ = 28984975200. Its totient is φ = 3001227840.
The previous prime is 11471047039. The next prime is 11471047073. The reversal of 11471047050 is 5074017411.
11471047050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 11471046999 and 11471047017.
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 23 ways as a sum of consecutive naturals, for example, 713500 + ... + 729399.
It is an arithmetic number, because the mean of its divisors is an integer number (603853650).
Almost surely, 211471047050 is an apocalyptic number.
11471047050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11471047050 is an abundant number, since it is smaller than the sum of its proper divisors (17513928150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11471047050 is a wasteful number, since it uses less digits than its factorization.
11471047050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1442967 (or 1442962 counting only the distinct ones).
The product of its (nonzero) digits is 3920, while the sum is 30.
The spelling of 11471047050 in words is "eleven billion, four hundred seventy-one million, forty-seven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •