Base | Representation |
---|---|
bin | 11110010010011001000… |
… | …11011110001000100001 |
3 | 10200111010211112020221221 |
4 | 33021030203132020201 |
5 | 114022241102440023 |
6 | 2114024153415041 |
7 | 135120453616042 |
oct | 17111443361041 |
9 | 3614124466857 |
10 | 1040666452513 |
11 | 37138709a636 |
12 | 14983110a481 |
13 | 771994428ac |
14 | 385233388c9 |
15 | 1c10b9e585d |
hex | f24c8de221 |
1040666452513 has 4 divisors (see below), whose sum is σ = 1051394972740. Its totient is φ = 1029937932288.
The previous prime is 1040666452493. The next prime is 1040666452537. The reversal of 1040666452513 is 3152546660401.
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 586529285904 + 454137166609 = 765852^2 + 673897^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1040666452513 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1040666452513.
It is not an unprimeable number, because it can be changed into a prime (1040666450513) 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, 5364259968 + ... + 5364260161.
It is an arithmetic number, because the mean of its divisors is an integer number (262848743185).
Almost surely, 21040666452513 is an apocalyptic number.
It is an amenable number.
1040666452513 is a deficient number, since it is larger than the sum of its proper divisors (10728520227).
1040666452513 is an equidigital number, since it uses as much as digits as its factorization.
1040666452513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10728520226.
The product of its (nonzero) digits is 518400, while the sum is 43.
The spelling of 1040666452513 in words is "one trillion, forty billion, six hundred sixty-six million, four hundred fifty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •