Base | Representation |
---|---|
bin | 101101100001010011111010… |
… | …100111010001101000101001 |
3 | 222020212001100020221101011111 |
4 | 231201103322213101220221 |
5 | 202220044044332413001 |
6 | 1545443100524430321 |
7 | 60112026603644035 |
oct | 5541237247215051 |
9 | 866761306841144 |
10 | 200201220201001 |
11 | 58876951628628 |
12 | 1a5544076a83a1 |
13 | 8792b81326286 |
14 | 3761b0dbb31c5 |
15 | 1822a5e6de851 |
hex | b614fa9d1a29 |
200201220201001 has 16 divisors (see below), whose sum is σ = 201199704330240. Its totient is φ = 199203658698240.
The previous prime is 200201220200977. The next prime is 200201220201053. The reversal of 200201220201001 is 100102022102002.
It is a happy number.
200201220201001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 200201220201001 - 27 = 200201220200873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200201220201401) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4714700296 + ... + 4714742758.
It is an arithmetic number, because the mean of its divisors is an integer number (12574981520640).
Almost surely, 2200201220201001 is an apocalyptic number.
It is an amenable number.
200201220201001 is a deficient number, since it is larger than the sum of its proper divisors (998484129239).
200201220201001 is a wasteful number, since it uses less digits than its factorization.
200201220201001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52776.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 200201220201001 its reverse (100102022102002), we get a palindrome (300303242303003).
The spelling of 200201220201001 in words is "two hundred trillion, two hundred one billion, two hundred twenty million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •