Base | Representation |
---|---|
bin | 1001010000111001001010… |
… | …00010010111011001101111 |
3 | 2200010111210101212202222122 |
4 | 10220130211002113121233 |
5 | 10132232120210341223 |
6 | 111154335110303155 |
7 | 4201542336436103 |
oct | 450344502273157 |
9 | 80114711782878 |
10 | 20371651262063 |
11 | 654462905aaa2 |
12 | 23501b4957abb |
13 | b4a0666a071a |
14 | 505dc9411903 |
15 | 254da7acd5c8 |
hex | 12872509766f |
20371651262063 has 4 divisors (see below), whose sum is σ = 20371845747288. Its totient is φ = 20371456776840.
The previous prime is 20371651262059. The next prime is 20371651262099. The reversal of 20371651262063 is 36026215617302.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20371651262063 - 22 = 20371651262059 is a prime.
It is a super-2 number, since 2×203716512620632 (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 (20371651262863) 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, 97085408 + ... + 97295013.
It is an arithmetic number, because the mean of its divisors is an integer number (5092961436822).
Almost surely, 220371651262063 is an apocalyptic number.
20371651262063 is a deficient number, since it is larger than the sum of its proper divisors (194485225).
20371651262063 is a wasteful number, since it uses less digits than its factorization.
20371651262063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 194485224.
The product of its (nonzero) digits is 544320, while the sum is 44.
Adding to 20371651262063 its reverse (36026215617302), we get a palindrome (56397866879365).
The spelling of 20371651262063 in words is "twenty trillion, three hundred seventy-one billion, six hundred fifty-one million, two hundred sixty-two thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •