Base | Representation |
---|---|
bin | 1010010010100000010010… |
… | …1111000101110111011001 |
3 | 1111001111220001020110122021 |
4 | 2210220010233011313121 |
5 | 2440323032431430241 |
6 | 40021044155254441 |
7 | 2245224156343444 |
oct | 244500457056731 |
9 | 44044801213567 |
10 | 11313023311321 |
11 | 367190a802816 |
12 | 132865874a421 |
13 | 640a763c7024 |
14 | 2b17a619065b |
15 | 1494273720d1 |
hex | a4a04bc5dd9 |
11313023311321 has 4 divisors (see below), whose sum is σ = 11504769469200. Its totient is φ = 11121277153444.
The previous prime is 11313023311283. The next prime is 11313023311339. The reversal of 11313023311321 is 12311332031311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11313023311321 - 215 = 11313023278553 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11313023311921) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 95873078851 + ... + 95873078968.
It is an arithmetic number, because the mean of its divisors is an integer number (2876192367300).
Almost surely, 211313023311321 is an apocalyptic number.
It is an amenable number.
11313023311321 is a deficient number, since it is larger than the sum of its proper divisors (191746157879).
11313023311321 is an equidigital number, since it uses as much as digits as its factorization.
11313023311321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191746157878.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 11313023311321 its reverse (12311332031311), we get a palindrome (23624355342632).
The spelling of 11313023311321 in words is "eleven trillion, three hundred thirteen billion, twenty-three million, three hundred eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •