Base | Representation |
---|---|
bin | 1001001011110010100000… |
… | …10000011001011000000001 |
3 | 2122111202010122222212000000 |
4 | 10211321100100121120001 |
5 | 10121343441332420223 |
6 | 110542013313350213 |
7 | 4153063466323245 |
oct | 445712020313001 |
9 | 78452118885000 |
10 | 20196282701313 |
11 | 6487217083764 |
12 | 2322212268369 |
13 | b36669433594 |
14 | 4db710778425 |
15 | 250541cc8543 |
hex | 125e50419601 |
20196282701313 has 56 divisors (see below), whose sum is σ = 32063374754208. Its totient is φ = 12671547921792.
The previous prime is 20196282701299. The next prime is 20196282701327. The reversal of 20196282701313 is 31310728269102.
It is a happy number.
20196282701313 is a `hidden beast` number, since 2 + 0 + 1 + 9 + 62 + 8 + 270 + 1 + 313 = 666.
It is an interprime number because it is at equal distance from previous prime (20196282701299) and next prime (20196282701327).
It is not a de Polignac number, because 20196282701313 - 26 = 20196282701249 is a prime.
It is not an unprimeable number, because it can be changed into a prime (20196282701813) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 465298270 + ... + 465341672.
It is an arithmetic number, because the mean of its divisors is an integer number (572560263468).
Almost surely, 220196282701313 is an apocalyptic number.
It is an amenable number.
20196282701313 is a deficient number, since it is larger than the sum of its proper divisors (11867092052895).
20196282701313 is an equidigital number, since it uses as much as digits as its factorization.
20196282701313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80985 (or 80970 counting only the distinct ones).
The product of its (nonzero) digits is 217728, while the sum is 45.
The spelling of 20196282701313 in words is "twenty trillion, one hundred ninety-six billion, two hundred eighty-two million, seven hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •