Base | Representation |
---|---|
bin | 1010010010111011011111… |
… | …0001110011001101101001 |
3 | 1111002012201201012212120212 |
4 | 2210232313301303031221 |
5 | 2440433004430012223 |
6 | 40024252330030505 |
7 | 2245603064201006 |
oct | 244566761631551 |
9 | 44065651185525 |
10 | 11320322110313 |
11 | 3674a157904a7 |
12 | 1329b54b78435 |
13 | 64166a59a1b8 |
14 | 2b1c9968a8ad |
15 | 14970300e278 |
hex | a4bb7c73369 |
11320322110313 has 8 divisors (see below), whose sum is σ = 11584033573728. Its totient is φ = 11056631017824.
The previous prime is 11320322110277. The next prime is 11320322110337. The reversal of 11320322110313 is 31301122302311.
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 11320322110313 - 26 = 11320322110249 is a prime.
It is a super-4 number, since 4×113203221103134 (a number of 53 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11320322110913) 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, 3965495 + ... + 6194012.
It is an arithmetic number, because the mean of its divisors is an integer number (1448004196716).
Almost surely, 211320322110313 is an apocalyptic number.
It is an amenable number.
11320322110313 is a deficient number, since it is larger than the sum of its proper divisors (263711463415).
11320322110313 is a wasteful number, since it uses less digits than its factorization.
11320322110313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10185463.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 11320322110313 its reverse (31301122302311), we get a palindrome (42621444412624).
The spelling of 11320322110313 in words is "eleven trillion, three hundred twenty billion, three hundred twenty-two million, one hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •