Base | Representation |
---|---|
bin | 11101011011001011001… |
… | …00010011101000111001 |
3 | 10120122121211000001100112 |
4 | 32231211210103220321 |
5 | 113031032430043001 |
6 | 2052242355514105 |
7 | 133021023343253 |
oct | 16554544235071 |
9 | 3518554001315 |
10 | 1011021331001 |
11 | 35a854203010 |
12 | 143b38bb8935 |
13 | 74453751386 |
14 | 36d100aacd3 |
15 | 1b47411acbb |
hex | eb65913a39 |
1011021331001 has 4 divisors (see below), whose sum is σ = 1102932361104. Its totient is φ = 919110300900.
The previous prime is 1011021330959. The next prime is 1011021331031. The reversal of 1011021331001 is 1001331201101.
It is a happy number.
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 not a de Polignac number, because 1011021331001 - 214 = 1011021314617 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1011021331031) 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, 45955515035 + ... + 45955515056.
It is an arithmetic number, because the mean of its divisors is an integer number (275733090276).
Almost surely, 21011021331001 is an apocalyptic number.
1011021331001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1011021331001 is a deficient number, since it is larger than the sum of its proper divisors (91911030103).
1011021331001 is an equidigital number, since it uses as much as digits as its factorization.
1011021331001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91911030102.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 1011021331001 its reverse (1001331201101), we get a palindrome (2012352532102).
The spelling of 1011021331001 in words is "one trillion, eleven billion, twenty-one million, three hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •