Base | Representation |
---|---|
bin | 1010000001000000000101… |
… | …1011011011000101111111 |
3 | 1102222202201112010021011202 |
4 | 2200100001123123011333 |
5 | 2420411212422104043 |
6 | 35230553502210115 |
7 | 2214420362336225 |
oct | 240200133330577 |
9 | 42882645107152 |
10 | 11012320113023 |
11 | 35663316821a9 |
12 | 129a31788393b |
13 | 61b5c39a9368 |
14 | 2a0ddb8c0b15 |
15 | 1416c80ad1b8 |
hex | a04016db17f |
11012320113023 has 4 divisors (see below), whose sum is σ = 11031405590400. Its totient is φ = 10993234635648.
The previous prime is 11012320113007. The next prime is 11012320113029. The reversal of 11012320113023 is 32031102321011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11012320113023 - 24 = 11012320113007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11012320112986 and 11012320113004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012320113029) 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, 9542737823 + ... + 9542738976.
It is an arithmetic number, because the mean of its divisors is an integer number (2757851397600).
Almost surely, 211012320113023 is an apocalyptic number.
11012320113023 is a deficient number, since it is larger than the sum of its proper divisors (19085477377).
11012320113023 is an equidigital number, since it uses as much as digits as its factorization.
11012320113023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19085477376.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 11012320113023 its reverse (32031102321011), we get a palindrome (43043422434034).
The spelling of 11012320113023 in words is "eleven trillion, twelve billion, three hundred twenty million, one hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •