Base | Representation |
---|---|
bin | 11101011111000110100… |
… | …01111011001011000011 |
3 | 10120212001210122221220220 |
4 | 32233203101323023003 |
5 | 113044342343111121 |
6 | 2053231541234123 |
7 | 133124213443224 |
oct | 16574321731303 |
9 | 3525053587826 |
10 | 1013130441411 |
11 | 3607367a3970 |
12 | 144427402943 |
13 | 746cb6abbba |
14 | 3707024924b |
15 | 1b5493826c6 |
hex | ebe347b2c3 |
1013130441411 has 32 divisors (see below), whose sum is σ = 1512662328576. Its totient is φ = 597821952000.
The previous prime is 1013130441383. The next prime is 1013130441469. The reversal of 1013130441411 is 1141440313101.
It is not a de Polignac number, because 1013130441411 - 225 = 1013096886979 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1013130441811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 98206 + ... + 1426851.
It is an arithmetic number, because the mean of its divisors is an integer number (47270697768).
Almost surely, 21013130441411 is an apocalyptic number.
1013130441411 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1013130441411 is a deficient number, since it is larger than the sum of its proper divisors (499531887165).
1013130441411 is a wasteful number, since it uses less digits than its factorization.
1013130441411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1525603.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 1013130441411 its reverse (1141440313101), we get a palindrome (2154570754512).
It can be divided in two parts, 1013130 and 441411, that added together give a palindrome (1454541).
The spelling of 1013130441411 in words is "one trillion, thirteen billion, one hundred thirty million, four hundred forty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •