Base | Representation |
---|---|
bin | 1010000010111110000001… |
… | …0000000001000011011111 |
3 | 1110002222222022121122222102 |
4 | 2200233200100001003133 |
5 | 2421434430020304043 |
6 | 35254304032035315 |
7 | 2220025142055203 |
oct | 240574020010337 |
9 | 43088868548872 |
10 | 11046123213023 |
11 | 35796a8644588 |
12 | 12a4990392b3b |
13 | 62184cc52892 |
14 | 2a28c7066b03 |
15 | 142505a166b8 |
hex | a0be04010df |
11046123213023 has 4 divisors (see below), whose sum is σ = 11087186868360. Its totient is φ = 11005059557688.
The previous prime is 11046123213017. The next prime is 11046123213061. The reversal of 11046123213023 is 32031232164011.
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 11046123213023 - 238 = 10771245306079 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11046123218023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20531827265 + ... + 20531827802.
It is an arithmetic number, because the mean of its divisors is an integer number (2771796717090).
Almost surely, 211046123213023 is an apocalyptic number.
11046123213023 is a deficient number, since it is larger than the sum of its proper divisors (41063655337).
11046123213023 is an equidigital number, since it uses as much as digits as its factorization.
11046123213023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41063655336.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 11046123213023 its reverse (32031232164011), we get a palindrome (43077355377034).
The spelling of 11046123213023 in words is "eleven trillion, forty-six billion, one hundred twenty-three million, two hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •