Base | Representation |
---|---|
bin | 10010111010110000000… |
… | …100101011111101011011 |
3 | 11121021121121121001022021 |
4 | 102322300010223331123 |
5 | 132244432220021133 |
6 | 2433121043235311 |
7 | 162632025611020 |
oct | 22726004537533 |
9 | 4537547531267 |
10 | 1300034142043 |
11 | 46138342165a |
12 | 18bb56978b37 |
13 | 957921bc830 |
14 | 46cc9d15547 |
15 | 23c3be1b52d |
hex | 12eb012bf5b |
1300034142043 has 8 divisors (see below), whose sum is σ = 1600042021088. Its totient is φ = 1028598441984.
The previous prime is 1300034142007. The next prime is 1300034142049. The reversal of 1300034142043 is 3402414300031.
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 1300034142043 - 233 = 1291444207451 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1300034141999 and 1300034142017.
It is not an unprimeable number, because it can be changed into a prime (1300034142049) 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, 7143044646 + ... + 7143044827.
It is an arithmetic number, because the mean of its divisors is an integer number (200005252636).
Almost surely, 21300034142043 is an apocalyptic number.
1300034142043 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1300034142043 is a deficient number, since it is larger than the sum of its proper divisors (300007879045).
1300034142043 is a wasteful number, since it uses less digits than its factorization.
1300034142043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14286089493.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 1300034142043 its reverse (3402414300031), we get a palindrome (4702448442074).
The spelling of 1300034142043 in words is "one trillion, three hundred billion, thirty-four million, one hundred forty-two thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •