Base | Representation |
---|---|
bin | 10101000101101000… |
… | …01001110010010001 |
3 | 1002020000102120010001 |
4 | 22202310021302101 |
5 | 141141301441103 |
6 | 5111231210001 |
7 | 550362201544 |
oct | 124264116221 |
9 | 32200376101 |
10 | 11321515153 |
11 | 488a7779a3 |
12 | 223b676901 |
13 | 10b57193c0 |
14 | 79588485b |
15 | 463ded01d |
hex | 2a2d09c91 |
11321515153 has 8 divisors (see below), whose sum is σ = 12201877800. Its totient is φ = 10442506368.
The previous prime is 11321515103. The next prime is 11321515181. The reversal of 11321515153 is 35151512311.
It can be written as a sum of positive squares in 4 ways, for example, as 2398256784 + 8923258369 = 48972^2 + 94463^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11321515153 is a prime.
It is a super-2 number, since 2×113215151532 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11321515103) 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, 321058 + ... + 354571.
It is an arithmetic number, because the mean of its divisors is an integer number (1525234725).
Almost surely, 211321515153 is an apocalyptic number.
11321515153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11321515153 is a deficient number, since it is larger than the sum of its proper divisors (880362647).
11321515153 is a wasteful number, since it uses less digits than its factorization.
11321515153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 676931.
The product of its digits is 2250, while the sum is 28.
The spelling of 11321515153 in words is "eleven billion, three hundred twenty-one million, five hundred fifteen thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •