Base | Representation |
---|---|
bin | 11110110001110100000… |
… | …010000101110111100101 |
3 | 21111012100220111202111012 |
4 | 132301310002011313211 |
5 | 234123131034140023 |
6 | 4255352223352005 |
7 | 305544264410456 |
oct | 36616402056745 |
9 | 7435326452435 |
10 | 2115070615013 |
11 | 745aa624a014 |
12 | 2a1ab8a52605 |
13 | 1245b1415595 |
14 | 7452727712d |
15 | 3a040329978 |
hex | 1ec74085de5 |
2115070615013 has 4 divisors (see below), whose sum is σ = 2122289286348. Its totient is φ = 2107851943680.
The previous prime is 2115070614989. The next prime is 2115070615081. The reversal of 2115070615013 is 3105160705112.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1779988242244 + 335082372769 = 1334162^2 + 578863^2 .
It is a cyclic number.
It is not a de Polignac number, because 2115070615013 - 226 = 2115003506149 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2115010615013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3609335228 + ... + 3609335813.
It is an arithmetic number, because the mean of its divisors is an integer number (530572321587).
Almost surely, 22115070615013 is an apocalyptic number.
It is an amenable number.
2115070615013 is a deficient number, since it is larger than the sum of its proper divisors (7218671335).
2115070615013 is an equidigital number, since it uses as much as digits as its factorization.
2115070615013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7218671334.
The product of its (nonzero) digits is 6300, while the sum is 32.
Subtracting 2115070615013 from its reverse (3105160705112), we obtain a palindrome (990090090099).
The spelling of 2115070615013 in words is "two trillion, one hundred fifteen billion, seventy million, six hundred fifteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •