Base | Representation |
---|---|
bin | 10100100001000000… |
… | …11111001110111011 |
3 | 1001102121110222111100 |
4 | 22100200133032323 |
5 | 140024134321420 |
6 | 5020540102443 |
7 | 536642413401 |
oct | 122040371673 |
9 | 31377428440 |
10 | 11014370235 |
11 | 4742363420 |
12 | 2174834a23 |
13 | 1066bb944b |
14 | 766b71471 |
15 | 446e7c190 |
hex | 29081f3bb |
11014370235 has 48 divisors (see below), whose sum is σ = 21311566848. Its totient is φ = 5216097600.
The previous prime is 11014370179. The next prime is 11014370251. The reversal of 11014370235 is 53207341011.
11014370235 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11014370235 - 214 = 11014353851 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11014370199 and 11014370208.
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 47 ways as a sum of consecutive naturals, for example, 237451 + ... + 280020.
It is an arithmetic number, because the mean of its divisors is an integer number (443990976).
Almost surely, 211014370235 is an apocalyptic number.
11014370235 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11014370235 is a deficient number, since it is larger than the sum of its proper divisors (10297196613).
11014370235 is a wasteful number, since it uses less digits than its factorization.
11014370235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 517536 (or 517533 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The spelling of 11014370235 in words is "eleven billion, fourteen million, three hundred seventy thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •