Base | Representation |
---|---|
bin | 10101000011000101… |
… | …11110001100100111 |
3 | 1002011112101100220001 |
4 | 22201202332030213 |
5 | 141120324442043 |
6 | 5105151122131 |
7 | 550013255461 |
oct | 124142761447 |
9 | 32145340801 |
10 | 11300234023 |
11 | 4879762091 |
12 | 2234513347 |
13 | 10b11a7b10 |
14 | 792b05131 |
15 | 4620e774d |
hex | 2a18be327 |
11300234023 has 16 divisors (see below), whose sum is σ = 12432712320. Its totient is φ = 10207701504.
The previous prime is 11300234009. The next prime is 11300234081. The reversal of 11300234023 is 32043200311.
11300234023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11300234023 - 229 = 10763363111 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 (11300234083) 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 15 ways as a sum of consecutive naturals, for example, 67365 + ... + 164737.
It is an arithmetic number, because the mean of its divisors is an integer number (777044520).
Almost surely, 211300234023 is an apocalyptic number.
11300234023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11300234023 is a deficient number, since it is larger than the sum of its proper divisors (1132478297).
11300234023 is a wasteful number, since it uses less digits than its factorization.
11300234023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97578.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 11300234023 its reverse (32043200311), we get a palindrome (43343434334).
The spelling of 11300234023 in words is "eleven billion, three hundred million, two hundred thirty-four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •