Base | Representation |
---|---|
bin | 10010111011010110110… |
… | …001011011110000000101 |
3 | 11121100021212022002111010 |
4 | 102323112301123300011 |
5 | 132302244423000331 |
6 | 2433305315232433 |
7 | 162654101351604 |
oct | 22732661336005 |
9 | 4540255262433 |
10 | 1300683406341 |
11 | 461686968520 |
12 | 1900b82a8719 |
13 | 958668769a7 |
14 | 46d4c243a3b |
15 | 23c78e1ae46 |
hex | 12ed6c5bc05 |
1300683406341 has 8 divisors (see below), whose sum is σ = 1891903136544. Its totient is φ = 788292973520.
The previous prime is 1300683406339. The next prime is 1300683406367. The reversal of 1300683406341 is 1436043860031.
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 1300683406341 - 21 = 1300683406339 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1300683406341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1300683406241) 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, 19707324306 + ... + 19707324371.
It is an arithmetic number, because the mean of its divisors is an integer number (236487892068).
Almost surely, 21300683406341 is an apocalyptic number.
1300683406341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1300683406341 is a deficient number, since it is larger than the sum of its proper divisors (591219730203).
1300683406341 is a wasteful number, since it uses less digits than its factorization.
1300683406341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39414648691.
The product of its (nonzero) digits is 124416, while the sum is 39.
The spelling of 1300683406341 in words is "one trillion, three hundred billion, six hundred eighty-three million, four hundred six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •