Base | Representation |
---|---|
bin | 10011010110111101000… |
… | …001110111011000101101 |
3 | 11201011210000202220111002 |
4 | 103112331001313120231 |
5 | 133243441431333133 |
6 | 2455045554410045 |
7 | 165053322532433 |
oct | 23267501673055 |
9 | 4634700686432 |
10 | 1330316277293 |
11 | 473202948013 |
12 | 1959a8290925 |
13 | 985a9b69163 |
14 | 4855da02d53 |
15 | 249106c5ce8 |
hex | 135bd07762d |
1330316277293 has 4 divisors (see below), whose sum is σ = 1330885033920. Its totient is φ = 1329747520668.
The previous prime is 1330316277281. The next prime is 1330316277299. The reversal of 1330316277293 is 3927726130331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1330316277293 - 222 = 1330312082989 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 (1330316277299) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 284374805 + ... + 284379482.
It is an arithmetic number, because the mean of its divisors is an integer number (332721258480).
Almost surely, 21330316277293 is an apocalyptic number.
It is an amenable number.
1330316277293 is a deficient number, since it is larger than the sum of its proper divisors (568756627).
1330316277293 is an equidigital number, since it uses as much as digits as its factorization.
1330316277293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 568756626.
The product of its (nonzero) digits is 857304, while the sum is 47.
The spelling of 1330316277293 in words is "one trillion, three hundred thirty billion, three hundred sixteen million, two hundred seventy-seven thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •