Base | Representation |
---|---|
bin | 101101100001010011111010… |
… | …000101010111110010011111 |
3 | 222020212001022122012211112210 |
4 | 231201103322011113302133 |
5 | 202220044040044011221 |
6 | 1545443100010131503 |
7 | 60112026435256305 |
oct | 5541237205276237 |
9 | 866761278184483 |
10 | 200201211313311 |
11 | 5887694760812a |
12 | 1a554404720b93 |
13 | 8792b7c533aa0 |
14 | 3761b0c93c275 |
15 | 1822a5da36276 |
hex | b614fa157c9f |
200201211313311 has 8 divisors (see below), whose sum is σ = 287468405988400. Its totient is φ = 123200745423552.
The previous prime is 200201211313307. The next prime is 200201211313331. The reversal of 200201211313311 is 113313112102002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200201211313311 - 22 = 200201211313307 is a prime.
It is a super-2 number, since 2×2002012113133112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200201211313331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2566682196286 + ... + 2566682196363.
It is an arithmetic number, because the mean of its divisors is an integer number (35933550748550).
Almost surely, 2200201211313311 is an apocalyptic number.
200201211313311 is a deficient number, since it is larger than the sum of its proper divisors (87267194675089).
200201211313311 is a wasteful number, since it uses less digits than its factorization.
200201211313311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5133364392665.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 200201211313311 its reverse (113313112102002), we get a palindrome (313514323415313).
The spelling of 200201211313311 in words is "two hundred trillion, two hundred one billion, two hundred eleven million, three hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •