Base | Representation |
---|---|
bin | 1010010010100001011100… |
… | …0001000011111111000111 |
3 | 1111001112200102100111000111 |
4 | 2210220113001003333013 |
5 | 2440324144440341403 |
6 | 40021134433053451 |
7 | 2245234602302020 |
oct | 244502701037707 |
9 | 44045612314014 |
10 | 11313330012103 |
11 | 3671a57943639 |
12 | 13287233b7287 |
13 | 640ac4acca92 |
14 | 2b17d4bc9c47 |
15 | 14944425656d |
hex | a4a17043fc7 |
11313330012103 has 8 divisors (see below), whose sum is σ = 12948231336320. Its totient is φ = 9683106518520.
The previous prime is 11313330012013. The next prime is 11313330012191. The reversal of 11313330012103 is 30121003331311.
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 11313330012103 - 29 = 11313330011591 is a prime.
It is a super-2 number, since 2×113133300121032 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11313330016103) 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, 1169452473 + ... + 1169462146.
It is an arithmetic number, because the mean of its divisors is an integer number (1618528917040).
Almost surely, 211313330012103 is an apocalyptic number.
11313330012103 is a deficient number, since it is larger than the sum of its proper divisors (1634901324217).
11313330012103 is an equidigital number, since it uses as much as digits as its factorization.
11313330012103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2338915317.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 11313330012103 its reverse (30121003331311), we get a palindrome (41434333343414).
The spelling of 11313330012103 in words is "eleven trillion, three hundred thirteen billion, three hundred thirty million, twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •