Base | Representation |
---|---|
bin | 10100000111010011111… |
… | …10010101101000001001 |
3 | 2110001220100120211101220 |
4 | 22003221332111220021 |
5 | 42310403232401301 |
6 | 1245255104232253 |
7 | 100634413526244 |
oct | 12035176255011 |
9 | 2401810524356 |
10 | 691120200201 |
11 | 247114376682 |
12 | b1b3a90b689 |
13 | 50231883a32 |
14 | 25643c5c25b |
15 | 12e9e720936 |
hex | a0e9f95a09 |
691120200201 has 8 divisors (see below), whose sum is σ = 969993263520. Its totient is φ = 436496968512.
The previous prime is 691120200161. The next prime is 691120200227. The reversal of 691120200201 is 102002021196.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 691120200201 - 215 = 691120167433 is a prime.
It is a super-2 number, since 2×6911202002012 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (691120205201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6062457840 + ... + 6062457953.
It is an arithmetic number, because the mean of its divisors is an integer number (121249157940).
Almost surely, 2691120200201 is an apocalyptic number.
It is an amenable number.
691120200201 is a deficient number, since it is larger than the sum of its proper divisors (278873063319).
691120200201 is a wasteful number, since it uses less digits than its factorization.
691120200201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12124915815.
The product of its (nonzero) digits is 432, while the sum is 24.
Adding to 691120200201 its reverse (102002021196), we get a palindrome (793122221397).
The spelling of 691120200201 in words is "six hundred ninety-one billion, one hundred twenty million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •