Base | Representation |
---|---|
bin | 1010000000111111010110… |
… | …1011111000001101110111 |
3 | 1102222202012210101222010222 |
4 | 2200033311223320031313 |
5 | 2420410312003200043 |
6 | 35230522143404555 |
7 | 2214412450632263 |
oct | 240176553701567 |
9 | 42882183358128 |
10 | 11012123100023 |
11 | 356624044a441 |
12 | 129a2818b375b |
13 | 61b591c29816 |
14 | 2a0dbd6790a3 |
15 | 1416b5b43d68 |
hex | a03f5af8377 |
11012123100023 has 8 divisors (see below), whose sum is σ = 11764719102720. Its totient is φ = 10276828155000.
The previous prime is 11012123100019. The next prime is 11012123100031. The reversal of 11012123100023 is 32000132121011.
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 11012123100023 - 22 = 11012123100019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11012123099974 and 11012123100010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012123100073) 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, 4325263103 + ... + 4325265648.
It is an arithmetic number, because the mean of its divisors is an integer number (1470589887840).
Almost surely, 211012123100023 is an apocalyptic number.
11012123100023 is a deficient number, since it is larger than the sum of its proper divisors (752596002697).
11012123100023 is an equidigital number, since it uses as much as digits as its factorization.
11012123100023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8650528837.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11012123100023 its reverse (32000132121011), we get a palindrome (43012255221034).
The spelling of 11012123100023 in words is "eleven trillion, twelve billion, one hundred twenty-three million, one hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •