Base | Representation |
---|---|
bin | 101101101100111101110010… |
… | …111010001001111110010101 |
3 | 222100200121120002222002012222 |
4 | 231230331302322021332111 |
5 | 202321204301144131313 |
6 | 1551255031400152125 |
7 | 60223631321516330 |
oct | 5554756272117625 |
9 | 870617502862188 |
10 | 201002102333333 |
11 | 59055570720404 |
12 | 1a663679468645 |
13 | 8820555c81632 |
14 | 378c7a7363617 |
15 | 18387d517e208 |
hex | b6cf72e89f95 |
201002102333333 has 32 divisors (see below), whose sum is σ = 238592003086080. Its totient is φ = 165748848445440.
The previous prime is 201002102333297. The next prime is 201002102333399. The reversal of 201002102333333 is 333333201200102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 201002102333333 - 26 = 201002102333269 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201002102333033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 101448266 + ... + 103410612.
It is an arithmetic number, because the mean of its divisors is an integer number (7456000096440).
Almost surely, 2201002102333333 is an apocalyptic number.
It is an amenable number.
201002102333333 is a deficient number, since it is larger than the sum of its proper divisors (37589900752747).
201002102333333 is a wasteful number, since it uses less digits than its factorization.
201002102333333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1967357.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 201002102333333 its reverse (333333201200102), we get a palindrome (534335303533435).
The spelling of 201002102333333 in words is "two hundred one trillion, two billion, one hundred two million, three hundred thirty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •