Base | Representation |
---|---|
bin | 1010000001000111111101… |
… | …1011110010001000111000 |
3 | 1102222222011212000210101110 |
4 | 2200101333123302020320 |
5 | 2420430030114333012 |
6 | 35231543341120320 |
7 | 2214523642261323 |
oct | 240217733621070 |
9 | 42888155023343 |
10 | 11014434136632 |
11 | 3567216a19453 |
12 | 129a8078590a0 |
13 | 61b86c9672c4 |
14 | 2a115c57b7ba |
15 | 14179d99573c |
hex | a047f6f2238 |
11014434136632 has 32 divisors (see below), whose sum is σ = 27643229658000. Its totient is φ = 3657192136704.
The previous prime is 11014434136567. The next prime is 11014434136639. The reversal of 11014434136632 is 23663143441011.
It is a super-2 number, since 2×110144341366322 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11014434136639) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 892863007 + ... + 892875342.
Almost surely, 211014434136632 is an apocalyptic number.
11014434136632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11014434136632 is an abundant number, since it is smaller than the sum of its proper divisors (16628795521368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11014434136632 is a wasteful number, since it uses less digits than its factorization.
11014434136632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1785738615 (or 1785738611 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 39.
Adding to 11014434136632 its reverse (23663143441011), we get a palindrome (34677577577643).
The spelling of 11014434136632 in words is "eleven trillion, fourteen billion, four hundred thirty-four million, one hundred thirty-six thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •