Base | Representation |
---|---|
bin | 10101000100111000… |
… | …10001001011110111 |
3 | 1002012120122110102202 |
4 | 22202130101023313 |
5 | 141133201112012 |
6 | 5110445055115 |
7 | 550255033511 |
oct | 124234211367 |
9 | 32176573382 |
10 | 11315254007 |
11 | 48871908a2 |
12 | 223955749b |
13 | 10b4336595 |
14 | 794ad4bb1 |
15 | 4635b2cc2 |
hex | 2a27112f7 |
11315254007 has 4 divisors (see below), whose sum is σ = 11390189616. Its totient is φ = 11240318400.
The previous prime is 11315254003. The next prime is 11315254037. The reversal of 11315254007 is 70045251311.
11315254007 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 70045251311 = 7 ⋅10006464473.
It is a cyclic number.
It is not a de Polignac number, because 11315254007 - 22 = 11315254003 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 (11315254003) 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, 37467578 + ... + 37467879.
It is an arithmetic number, because the mean of its divisors is an integer number (2847547404).
Almost surely, 211315254007 is an apocalyptic number.
11315254007 is a deficient number, since it is larger than the sum of its proper divisors (74935609).
11315254007 is an equidigital number, since it uses as much as digits as its factorization.
11315254007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74935608.
The product of its (nonzero) digits is 4200, while the sum is 29.
The spelling of 11315254007 in words is "eleven billion, three hundred fifteen million, two hundred fifty-four thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •