Base | Representation |
---|---|
bin | 1010000001000010101000… |
… | …0010011000101111100010 |
3 | 1102222211111000010000200101 |
4 | 2200100222002120233202 |
5 | 2420414111330300100 |
6 | 35231145241013014 |
7 | 2214443304325243 |
oct | 240205202305742 |
9 | 42884430100611 |
10 | 11013001415650 |
11 | 3566651210a23 |
12 | 129a487a8416a |
13 | 61b6a1ba0200 |
14 | 2a106418ccca |
15 | 141717cda86a |
hex | a042a098be2 |
11013001415650 has 36 divisors (see below), whose sum is σ = 22181097187782. Its totient is φ = 4066338981120.
The previous prime is 11013001415641. The next prime is 11013001415653. The reversal of 11013001415650 is 5651410031011.
It can be written as a sum of positive squares in 9 ways, for example, as 2184930378801 + 8828071036849 = 1478151^2 + 2971207^2 .
It is a super-2 number, since 2×110130014156502 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11013001415653) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 651648439 + ... + 651665338.
Almost surely, 211013001415650 is an apocalyptic number.
11013001415650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11013001415650 is an abundant number, since it is smaller than the sum of its proper divisors (11168095772132).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11013001415650 is a wasteful number, since it uses less digits than its factorization.
11013001415650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1303313815 (or 1303313797 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 28.
Adding to 11013001415650 its reverse (5651410031011), we get a palindrome (16664411446661).
The spelling of 11013001415650 in words is "eleven trillion, thirteen billion, one million, four hundred fifteen thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •