Base | Representation |
---|---|
bin | 1010011110010001010010… |
… | …0000010000001111010111 |
3 | 1111202211121200202012021210 |
4 | 2213210110200100033113 |
5 | 3002131012214220043 |
6 | 40253553144112503 |
7 | 2265641120150451 |
oct | 247442440201727 |
9 | 44684550665253 |
10 | 11515151320023 |
11 | 373a6037a239a |
12 | 135b868a65733 |
13 | 656b4955c840 |
14 | 2bb49cb2d2d1 |
15 | 14e807542633 |
hex | a79148103d7 |
11515151320023 has 16 divisors (see below), whose sum is σ = 16547403771360. Its totient is φ = 7080749458944.
The previous prime is 11515151320007. The next prime is 11515151320031. The reversal of 11515151320023 is 32002315151511.
It is not a de Polignac number, because 11515151320023 - 24 = 11515151320007 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11515151320073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 114480486 + ... + 114581027.
It is an arithmetic number, because the mean of its divisors is an integer number (1034212735710).
Almost surely, 211515151320023 is an apocalyptic number.
11515151320023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11515151320023 is a deficient number, since it is larger than the sum of its proper divisors (5032252451337).
11515151320023 is a wasteful number, since it uses less digits than its factorization.
11515151320023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229062818.
The product of its (nonzero) digits is 4500, while the sum is 30.
Adding to 11515151320023 its reverse (32002315151511), we get a palindrome (43517466471534).
The spelling of 11515151320023 in words is "eleven trillion, five hundred fifteen billion, one hundred fifty-one million, three hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •