Base | Representation |
---|---|
bin | 1010001101101011001010… |
… | …1010100000101010010111 |
3 | 1110202120200221021002101100 |
4 | 2203122302222200222113 |
5 | 2432443111223000043 |
6 | 35515002102001143 |
7 | 2236225624004250 |
oct | 243326252405227 |
9 | 43676627232340 |
10 | 11230042000023 |
11 | 363a6a7a40400 |
12 | 131455a4161b3 |
13 | 635cb07222b2 |
14 | 2ab7734b5b27 |
15 | 1471bc2a1cd3 |
hex | a36b2aa0a97 |
11230042000023 has 144 divisors (see below), whose sum is σ = 21219328166400. Its totient is φ = 5595304176000.
The previous prime is 11230041999997. The next prime is 11230042000061. The reversal of 11230042000023 is 32000024003211.
11230042000023 is a `hidden beast` number, since 11 + 230 + 0 + 420 + 0 + 0 + 0 + 2 + 3 = 666.
It is not a de Polignac number, because 11230042000023 - 25 = 11230041999991 is a prime.
It is a super-2 number, since 2×112300420000232 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11230042000063) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 33212908 + ... + 33549326.
It is an arithmetic number, because the mean of its divisors is an integer number (147356445600).
Almost surely, 211230042000023 is an apocalyptic number.
11230042000023 is a deficient number, since it is larger than the sum of its proper divisors (9989286166377).
11230042000023 is a wasteful number, since it uses less digits than its factorization.
11230042000023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336634 (or 336620 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 11230042000023 its reverse (32000024003211), we get a palindrome (43230066003234).
The spelling of 11230042000023 in words is "eleven trillion, two hundred thirty billion, forty-two million, twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •