Base | Representation |
---|---|
bin | 1001011000111000101000… |
… | …00111010110011010110111 |
3 | 2201002202120022221022221122 |
4 | 10230130110013112122313 |
5 | 10201232002241404111 |
6 | 111524430520534155 |
7 | 4230433130101433 |
oct | 454342407263267 |
9 | 81082508838848 |
10 | 20646245263031 |
11 | 6640029228183 |
12 | 239546992135b |
13 | b69c17b33abb |
14 | 5153d82c39c3 |
15 | 25c0c9b1dcdb |
hex | 12c7141d66b7 |
20646245263031 has 8 divisors (see below), whose sum is σ = 20851374850464. Its totient is φ = 20441129623200.
The previous prime is 20646245263027. The next prime is 20646245263073. The reversal of 20646245263031 is 13036254264602.
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 20646245263031 - 22 = 20646245263027 is a prime.
It is a super-2 number, since 2×206462452630312 (a number of 27 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 (20646245263081) 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 7 ways as a sum of consecutive naturals, for example, 498995 + ... + 6445268.
It is an arithmetic number, because the mean of its divisors is an integer number (2606421856308).
Almost surely, 220646245263031 is an apocalyptic number.
20646245263031 is a deficient number, since it is larger than the sum of its proper divisors (205129587433).
20646245263031 is a wasteful number, since it uses less digits than its factorization.
20646245263031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6973801.
The product of its (nonzero) digits is 1244160, while the sum is 44.
The spelling of 20646245263031 in words is "twenty trillion, six hundred forty-six billion, two hundred forty-five million, two hundred sixty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •