Base | Representation |
---|---|
bin | 11101011011110000000… |
… | …01101000110111011101 |
3 | 10120200102101201101002120 |
4 | 32231320001220313131 |
5 | 113032201214310023 |
6 | 2052333221213153 |
7 | 133031503514442 |
oct | 16557001506735 |
9 | 3520371641076 |
10 | 1011331010013 |
11 | 35a9a2a98485 |
12 | 1440048611b9 |
13 | 744a295a8ac |
14 | 36d3d27d9c9 |
15 | 1b4913dc8e3 |
hex | eb78068ddd |
1011331010013 has 4 divisors (see below), whose sum is σ = 1348441346688. Its totient is φ = 674220673340.
The previous prime is 1011331010003. The next prime is 1011331010083. The reversal of 1011331010013 is 3100101331101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1011331010013 - 233 = 1002741075421 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1011331009974 and 1011331010001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011331010003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 168555168333 + ... + 168555168338.
It is an arithmetic number, because the mean of its divisors is an integer number (337110336672).
Almost surely, 21011331010013 is an apocalyptic number.
It is an amenable number.
1011331010013 is a deficient number, since it is larger than the sum of its proper divisors (337110336675).
1011331010013 is an equidigital number, since it uses as much as digits as its factorization.
1011331010013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 337110336674.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 1011331010013 its reverse (3100101331101), we get a palindrome (4111432341114).
The spelling of 1011331010013 in words is "one trillion, eleven billion, three hundred thirty-one million, ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •