Base | Representation |
---|---|
bin | 10011001101110001110… |
… | …011001011001001000101 |
3 | 11200020100102100112112011 |
4 | 103031301303023021011 |
5 | 133113302313402021 |
6 | 2450340214254221 |
7 | 164254222336663 |
oct | 23156163131105 |
9 | 4606312315464 |
10 | 1320464200261 |
11 | 46a007686798 |
12 | 193ab8957371 |
13 | 97699a0138b |
14 | 47ca7387c33 |
15 | 245357d6de1 |
hex | 13371ccb245 |
1320464200261 has 4 divisors (see below), whose sum is σ = 1320739703532. Its totient is φ = 1320188696992.
The previous prime is 1320464200213. The next prime is 1320464200267. The reversal of 1320464200261 is 1620024640231.
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 1262407297761 + 58056902500 = 1123569^2 + 240950^2 .
It is a cyclic number.
It is not a de Polignac number, because 1320464200261 - 215 = 1320464167493 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 (1320464200267) 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, 137744446 + ... + 137754031.
It is an arithmetic number, because the mean of its divisors is an integer number (330184925883).
Almost surely, 21320464200261 is an apocalyptic number.
It is an amenable number.
1320464200261 is a deficient number, since it is larger than the sum of its proper divisors (275503271).
1320464200261 is an equidigital number, since it uses as much as digits as its factorization.
1320464200261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 275503270.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 1320464200261 its reverse (1620024640231), we get a palindrome (2940488840492).
The spelling of 1320464200261 in words is "one trillion, three hundred twenty billion, four hundred sixty-four million, two hundred thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •