Base | Representation |
---|---|
bin | 10100100000111111… |
… | …10110011010001100 |
3 | 1001102121011111010012 |
4 | 22100133312122030 |
5 | 140024113444040 |
6 | 5020532332352 |
7 | 536641116032 |
oct | 122037663214 |
9 | 31377144105 |
10 | 11014203020 |
11 | 4742259827 |
12 | 21747740b8 |
13 | 1066b5b2c2 |
14 | 766b2a552 |
15 | 446e47865 |
hex | 2907f668c |
11014203020 has 48 divisors (see below), whose sum is σ = 23575261248. Its totient is φ = 4321470720.
The previous prime is 11014203017. The next prime is 11014203073. The reversal of 11014203020 is 2030241011.
11014203020 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 11014202986 and 11014203004.
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 15 ways as a sum of consecutive naturals, for example, 260054 + ... + 299426.
It is an arithmetic number, because the mean of its divisors is an integer number (491151276).
Almost surely, 211014203020 is an apocalyptic number.
11014203020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11014203020 is an abundant number, since it is smaller than the sum of its proper divisors (12561058228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11014203020 is a wasteful number, since it uses less digits than its factorization.
11014203020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39650 (or 39648 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 11014203020 its reverse (2030241011), we get a palindrome (13044444031).
The spelling of 11014203020 in words is "eleven billion, fourteen million, two hundred three thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •