Base | Representation |
---|---|
bin | 11101000110110110011… |
… | …00111101101000001101 |
3 | 10112121110101110002002211 |
4 | 32203123030331220031 |
5 | 112341211131134013 |
6 | 2043235540350421 |
7 | 132153441626236 |
oct | 16433314755015 |
9 | 3477411402084 |
10 | 1000110021133 |
11 | 356165041453 |
12 | 1419b29a5411 |
13 | 7340500a6c2 |
14 | 36596cc608d |
15 | 1b03624a23d |
hex | e8db33da0d |
1000110021133 has 8 divisors (see below), whose sum is σ = 1010861312888. Its totient is φ = 989367727104.
The previous prime is 1000110021121. The next prime is 1000110021149. The reversal of 1000110021133 is 3311200110001.
It can be written as a sum of positive squares in 4 ways, for example, as 137862204804 + 862247816329 = 371298^2 + 928573^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1000110021133 - 25 = 1000110021101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000110022133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2025816 + ... + 2470657.
It is an arithmetic number, because the mean of its divisors is an integer number (126357664111).
Almost surely, 21000110021133 is an apocalyptic number.
It is an amenable number.
1000110021133 is a deficient number, since it is larger than the sum of its proper divisors (10751291755).
1000110021133 is an equidigital number, since it uses as much as digits as its factorization.
1000110021133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4498863.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 1000110021133 its reverse (3311200110001), we get a palindrome (4311310131134).
The spelling of 1000110021133 in words is "one trillion, one hundred ten million, twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •