Base | Representation |
---|---|
bin | 11101011111011100001… |
… | …00001111010011001011 |
3 | 10120212112102011202211210 |
4 | 32233232010033103023 |
5 | 113100230204400321 |
6 | 2053301524024203 |
7 | 133131541545522 |
oct | 16575604172313 |
9 | 3525472152753 |
10 | 1013311403211 |
11 | 360819963178 |
12 | 144477b32063 |
13 | 7472a02b7a3 |
14 | 3708a2b34b9 |
15 | 1b55a1cab76 |
hex | ebee10f4cb |
1013311403211 has 4 divisors (see below), whose sum is σ = 1351081870952. Its totient is φ = 675540935472.
The previous prime is 1013311403207. The next prime is 1013311403287. The reversal of 1013311403211 is 1123041133101.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1013311403211 - 22 = 1013311403207 is a prime.
It is a super-2 number, since 2×10133114032112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1013311403711) 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 3 ways as a sum of consecutive naturals, for example, 168885233866 + ... + 168885233871.
It is an arithmetic number, because the mean of its divisors is an integer number (337770467738).
Almost surely, 21013311403211 is an apocalyptic number.
1013311403211 is a deficient number, since it is larger than the sum of its proper divisors (337770467741).
1013311403211 is an equidigital number, since it uses as much as digits as its factorization.
1013311403211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337770467740.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 1013311403211 its reverse (1123041133101), we get a palindrome (2136352536312).
The spelling of 1013311403211 in words is "one trillion, thirteen billion, three hundred eleven million, four hundred three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •