Base | Representation |
---|---|
bin | 1010010010100001011100… |
… | …1100011111111010111000 |
3 | 1111001112200121222210111120 |
4 | 2210220113030133322320 |
5 | 2440324201222310404 |
6 | 40021135021225240 |
7 | 2245234636626366 |
oct | 244502714377270 |
9 | 44045617883446 |
10 | 11313333010104 |
11 | 3671a59601024 |
12 | 1328724402220 |
13 | 640ac560c548 |
14 | 2b17d536a636 |
15 | 1494446499d9 |
hex | a4a1731feb8 |
11313333010104 has 16 divisors (see below), whose sum is σ = 28283332525320. Its totient is φ = 3771111003360.
The previous prime is 11313333010097. The next prime is 11313333010141. The reversal of 11313333010104 is 40101033331311.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 471388875421 = 11313333010104 / (1 + 1 + 3 + 1 + 3 + 3 + 3 + 3 + 0 + 1 + 0 + 1 + 0 + 4).
It is a congruent number.
It is an unprimeable number.
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, 235694437687 + ... + 235694437734.
Almost surely, 211313333010104 is an apocalyptic number.
It is an amenable number.
11313333010104 is an abundant number, since it is smaller than the sum of its proper divisors (16969999515216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11313333010104 is a wasteful number, since it uses less digits than its factorization.
11313333010104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 471388875430 (or 471388875426 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 11313333010104 its reverse (40101033331311), we get a palindrome (51414366341415).
The spelling of 11313333010104 in words is "eleven trillion, three hundred thirteen billion, three hundred thirty-three million, ten thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •