Base | Representation |
---|---|
bin | 1011101110001000111… |
… | …0101100010000000000 |
3 | 201020202101212221120121 |
4 | 2323202032230100000 |
5 | 11244343140411241 |
6 | 232301053150024 |
7 | 20355662511451 |
oct | 2734216542000 |
9 | 636671787517 |
10 | 201363997696 |
11 | 784417aa924 |
12 | 3303848b314 |
13 | 15cb0aa38c4 |
14 | 9a63301128 |
15 | 53880a6ad1 |
hex | 2ee23ac400 |
201363997696 has 99 divisors (see below), whose sum is σ = 414799058709. Its totient is φ = 97702391808.
The previous prime is 201363997673. The next prime is 201363997871. The reversal of 201363997696 is 696799363102.
The square root of 201363997696 is 448736.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 180183270400 + 21180727296 = 424480^2 + 145536^2 .
It is a super-2 number, since 2×2013639976962 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 531303235 + ... + 531303613.
Almost surely, 2201363997696 is an apocalyptic number.
201363997696 is the 448736-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201363997696
201363997696 is an abundant number, since it is smaller than the sum of its proper divisors (213435061013).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201363997696 is an frugal number, since it uses more digits than its factorization.
201363997696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 852 (or 418 counting only the distinct ones).
The product of its (nonzero) digits is 19840464, while the sum is 61.
The spelling of 201363997696 in words is "two hundred one billion, three hundred sixty-three million, nine hundred ninety-seven thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •