Base | Representation |
---|---|
bin | 10011001110010101000… |
… | …100101101101010001101 |
3 | 11200021212122221010001012 |
4 | 103032111010231222031 |
5 | 133121010314010103 |
6 | 2450515034455005 |
7 | 164304666505364 |
oct | 23162504555215 |
9 | 4607778833035 |
10 | 1321056000653 |
11 | 46a290744124 |
12 | 194042b94465 |
13 | 977624b8a1c |
14 | 47d21bd87db |
15 | 2456c7352d8 |
hex | 1339512da8d |
1321056000653 has 4 divisors (see below), whose sum is σ = 1398765177180. Its totient is φ = 1243346824128.
The previous prime is 1321056000623. The next prime is 1321056000661. The reversal of 1321056000653 is 3560006501231.
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 626412097444 + 694643903209 = 791462^2 + 833453^2 .
It is a cyclic number.
It is not a de Polignac number, because 1321056000653 - 210 = 1321055999629 is a prime.
It is a super-2 number, since 2×13210560006532 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1321056000613) 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, 38854588238 + ... + 38854588271.
It is an arithmetic number, because the mean of its divisors is an integer number (349691294295).
Almost surely, 21321056000653 is an apocalyptic number.
It is an amenable number.
1321056000653 is a deficient number, since it is larger than the sum of its proper divisors (77709176527).
1321056000653 is an equidigital number, since it uses as much as digits as its factorization.
1321056000653 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77709176526.
The product of its (nonzero) digits is 16200, while the sum is 32.
The spelling of 1321056000653 in words is "one trillion, three hundred twenty-one billion, fifty-six million, six hundred fifty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •