Base | Representation |
---|---|
bin | 1010000001000011100110… |
… | …0100011100010111101001 |
3 | 1102222212011011110011110101 |
4 | 2200100321210130113221 |
5 | 2420420130033023031 |
6 | 35231231150145401 |
7 | 2214452620300204 |
oct | 240207144342751 |
9 | 42885134404411 |
10 | 11013262001641 |
11 | 3566775315049 |
12 | 129a53b1b2261 |
13 | 61b713b7b0c3 |
14 | 2a108aa2293b |
15 | 141730b11361 |
hex | a043991c5e9 |
11013262001641 has 16 divisors (see below), whose sum is σ = 12072354307200. Its totient is φ = 10000406526208.
The previous prime is 11013262001587. The next prime is 11013262001669. The reversal of 11013262001641 is 14610026231011.
It is not a de Polignac number, because 11013262001641 - 243 = 2217168979433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11013262001681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7817995 + ... + 9118528.
It is an arithmetic number, because the mean of its divisors is an integer number (754522144200).
Almost surely, 211013262001641 is an apocalyptic number.
It is an amenable number.
11013262001641 is a deficient number, since it is larger than the sum of its proper divisors (1059092305559).
11013262001641 is a wasteful number, since it uses less digits than its factorization.
11013262001641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16937888.
The product of its (nonzero) digits is 1728, while the sum is 28.
Adding to 11013262001641 its reverse (14610026231011), we get a palindrome (25623288232652).
The spelling of 11013262001641 in words is "eleven trillion, thirteen billion, two hundred sixty-two million, one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •