Base | Representation |
---|---|
bin | 101101101100111101101110… |
… | …000100010001110111010011 |
3 | 222100200121100110010001102110 |
4 | 231230331232010101313103 |
5 | 202321204114400213021 |
6 | 1551255015335120403 |
7 | 60223626314201364 |
oct | 5554755604216723 |
9 | 870617313101373 |
10 | 201002021101011 |
11 | 59055529888359 |
12 | 1a663656213103 |
13 | 88205421ac380 |
14 | 378c79a659b6b |
15 | 18387cce85476 |
hex | b6cf6e111dd3 |
201002021101011 has 8 divisors (see below), whose sum is σ = 288618286709200. Its totient is φ = 123693551446752.
The previous prime is 201002021101001. The next prime is 201002021101033. The reversal of 201002021101011 is 110101120200102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201002021101011 - 230 = 201000947359187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201002021101001) 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, 2576948988436 + ... + 2576948988513.
It is an arithmetic number, because the mean of its divisors is an integer number (36077285838650).
Almost surely, 2201002021101011 is an apocalyptic number.
201002021101011 is a deficient number, since it is larger than the sum of its proper divisors (87616265608189).
201002021101011 is a wasteful number, since it uses less digits than its factorization.
201002021101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5153897976965.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 201002021101011 its reverse (110101120200102), we get a palindrome (311103141301113).
Subtracting from 201002021101011 its reverse (110101120200102), we obtain a palindrome (90900900900909).
The spelling of 201002021101011 in words is "two hundred one trillion, two billion, twenty-one million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •