Base | Representation |
---|---|
bin | 1010000000010110101101… |
… | …1001111101111001111101 |
3 | 1102221201001110112100111121 |
4 | 2200011223121331321331 |
5 | 2420220441040324313 |
6 | 35221515414550541 |
7 | 2213545214266336 |
oct | 240055331757175 |
9 | 42851043470447 |
10 | 11001213214333 |
11 | 3561652070891 |
12 | 1298138068451 |
13 | 61a543894164 |
14 | 2a066674528d |
15 | 141277e5528d |
hex | a016b67de7d |
11001213214333 has 8 divisors (see below), whose sum is σ = 11630793106400. Its totient is φ = 10376690189328.
The previous prime is 11001213214297. The next prime is 11001213214421. The reversal of 11001213214333 is 33341231210011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11001213214333 - 29 = 11001213213821 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11001213214298 and 11001213214307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001210214333) 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, 1264212291 + ... + 1264220992.
It is an arithmetic number, because the mean of its divisors is an integer number (1453849138300).
Almost surely, 211001213214333 is an apocalyptic number.
It is an amenable number.
11001213214333 is a deficient number, since it is larger than the sum of its proper divisors (629579892067).
11001213214333 is a wasteful number, since it uses less digits than its factorization.
11001213214333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2528433531.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 11001213214333 its reverse (33341231210011), we get a palindrome (44342444424344).
The spelling of 11001213214333 in words is "eleven trillion, one billion, two hundred thirteen million, two hundred fourteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •