Base | Representation |
---|---|
bin | 10100100001000011… |
… | …00011110010111001 |
3 | 1001102122000020201110 |
4 | 22100201203302321 |
5 | 140024222313230 |
6 | 5020550110533 |
7 | 536644663215 |
oct | 122041436271 |
9 | 31378006643 |
10 | 11014651065 |
11 | 4742535410 |
12 | 217494b449 |
13 | 1066c87212 |
14 | 766c05945 |
15 | 446ed54b0 |
hex | 290863cb9 |
11014651065 has 32 divisors (see below), whose sum is σ = 19588334976. Its totient is φ = 5239669760.
The previous prime is 11014651007. The next prime is 11014651073. The reversal of 11014651065 is 56015641011.
It is not a de Polignac number, because 11014651065 - 27 = 11014650937 is a prime.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 621024 + ... + 638513.
It is an arithmetic number, because the mean of its divisors is an integer number (612135468).
Almost surely, 211014651065 is an apocalyptic number.
11014651065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11014651065 is a deficient number, since it is larger than the sum of its proper divisors (8573683911).
11014651065 is a wasteful number, since it uses less digits than its factorization.
11014651065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1259609.
The product of its (nonzero) digits is 3600, while the sum is 30.
The spelling of 11014651065 in words is "eleven billion, fourteen million, six hundred fifty-one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •