Base | Representation |
---|---|
bin | 10011100000100011110… |
… | …100000001001100000001 |
3 | 11202011101212001120200022 |
4 | 103200203310001030001 |
5 | 133431102420312030 |
6 | 2503513251103225 |
7 | 165600035244065 |
oct | 23404364011401 |
9 | 4664355046608 |
10 | 1340630635265 |
11 | 4776160528a9 |
12 | 1979a65a1b15 |
13 | 99561a1075c |
14 | 48c5b7d5aa5 |
15 | 24d15e7bde5 |
hex | 13823d01301 |
1340630635265 has 8 divisors (see below), whose sum is σ = 1611381165288. Its totient is φ = 1070754906240.
The previous prime is 1340630635259. The next prime is 1340630635273. The reversal of 1340630635265 is 5625360360431.
It can be written as a sum of positive squares in 4 ways, for example, as 58262373376 + 1282368261889 = 241376^2 + 1132417^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1340630635265 - 24 = 1340630635249 is a prime.
It is a super-2 number, since 2×13406306352652 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 218696876 + ... + 218703005.
It is an arithmetic number, because the mean of its divisors is an integer number (201422645661).
Almost surely, 21340630635265 is an apocalyptic number.
It is an amenable number.
1340630635265 is a deficient number, since it is larger than the sum of its proper divisors (270750530023).
1340630635265 is an equidigital number, since it uses as much as digits as its factorization.
1340630635265 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 437400499.
The product of its (nonzero) digits is 1166400, while the sum is 44.
Adding to 1340630635265 its reverse (5625360360431), we get a palindrome (6965990995696).
The spelling of 1340630635265 in words is "one trillion, three hundred forty billion, six hundred thirty million, six hundred thirty-five thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •