Base | Representation |
---|---|
bin | 1010010010100000010000… |
… | …0100010111111001111111 |
3 | 1111001111212021011112110111 |
4 | 2210220010010113321333 |
5 | 2440323022100104043 |
6 | 40021043115250451 |
7 | 2245223662223365 |
oct | 244500404277177 |
9 | 44044767145414 |
10 | 11313012113023 |
11 | 3671904454325 |
12 | 1328654a49a27 |
13 | 640a73ca5c0a |
14 | 2b17a48b7635 |
15 | 1494263ae09d |
hex | a4a04117e7f |
11313012113023 has 8 divisors (see below), whose sum is σ = 11332255827600. Its totient is φ = 11293780308288.
The previous prime is 11313012113017. The next prime is 11313012113027. The reversal of 11313012113023 is 32031121031311.
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 11313012113023 - 25 = 11313012112991 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11313012112985 and 11313012113003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11313012113027) 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, 1075038 + ... + 4876651.
It is an arithmetic number, because the mean of its divisors is an integer number (1416531978450).
Almost surely, 211313012113023 is an apocalyptic number.
11313012113023 is a deficient number, since it is larger than the sum of its proper divisors (19243714577).
11313012113023 is an equidigital number, since it uses as much as digits as its factorization.
11313012113023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5954921.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 11313012113023 its reverse (32031121031311), we get a palindrome (43344133144334).
The spelling of 11313012113023 in words is "eleven trillion, three hundred thirteen billion, twelve million, one hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •