Base | Representation |
---|---|
bin | 101101111110111111110… |
… | …0000001001011010011101 |
3 | 211101012010011210011021212 |
4 | 1123331333200021122131 |
5 | 1312021413210313023 |
6 | 21235215013434205 |
7 | 1221415245564533 |
oct | 133757740113235 |
9 | 24335104704255 |
10 | 6320036026013 |
11 | 2017348634636 |
12 | 860a4733b965 |
13 | 36ac9116b0a8 |
14 | 17bc69d14153 |
15 | ae5ea62be78 |
hex | 5bf7f80969d |
6320036026013 has 4 divisors (see below), whose sum is σ = 6320299593468. Its totient is φ = 6319772458560.
The previous prime is 6320036025983. The next prime is 6320036026021. The reversal of 6320036026013 is 3106206300236.
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 971561119684 + 5348474906329 = 985678^2 + 2312677^2 .
It is a cyclic number.
It is not a de Polignac number, because 6320036026013 - 212 = 6320036021917 is a prime.
It is a super-2 number, since 2×63200360260132 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6320036023013) 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, 131747756 + ... + 131795717.
It is an arithmetic number, because the mean of its divisors is an integer number (1580074898367).
Almost surely, 26320036026013 is an apocalyptic number.
It is an amenable number.
6320036026013 is a deficient number, since it is larger than the sum of its proper divisors (263567455).
6320036026013 is a wasteful number, since it uses less digits than its factorization.
6320036026013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 263567454.
The product of its (nonzero) digits is 23328, while the sum is 32.
The spelling of 6320036026013 in words is "six trillion, three hundred twenty billion, thirty-six million, twenty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •