Base | Representation |
---|---|
bin | 10011100000100100111… |
… | …010001101010000000001 |
3 | 11202011110010200101000211 |
4 | 103200210322031100001 |
5 | 133431122123103003 |
6 | 2503515145314121 |
7 | 165600350525650 |
oct | 23404472152001 |
9 | 4664403611024 |
10 | 1340649034753 |
11 | 47762547a696 |
12 | 1979b0795941 |
13 | 99565783522 |
14 | 48c60025197 |
15 | 24d178b396d |
hex | 13824e8d401 |
1340649034753 has 8 divisors (see below), whose sum is σ = 1532221558272. Its totient is φ = 1149089319456.
The previous prime is 1340649034723. The next prime is 1340649034801. The reversal of 1340649034753 is 3574309460431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1340649034753 - 25 = 1340649034721 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1340649034697 and 1340649034706.
It is not an unprimeable number, because it can be changed into a prime (1340649034723) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2976700 + ... + 3397357.
It is an arithmetic number, because the mean of its divisors is an integer number (191527694784).
Almost surely, 21340649034753 is an apocalyptic number.
It is an amenable number.
1340649034753 is a deficient number, since it is larger than the sum of its proper divisors (191572523519).
1340649034753 is an equidigital number, since it uses as much as digits as its factorization.
1340649034753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6404111.
The product of its (nonzero) digits is 3265920, while the sum is 49.
The spelling of 1340649034753 in words is "one trillion, three hundred forty billion, six hundred forty-nine million, thirty-four thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •