Base | Representation |
---|---|
bin | 101101101100111101110010… |
… | …111010001001101001110110 |
3 | 222100200121120002222000102102 |
4 | 231230331302322021221312 |
5 | 202321204301144111042 |
6 | 1551255031400142102 |
7 | 60223631321512445 |
oct | 5554756272115166 |
9 | 870617502860372 |
10 | 201002102332022 |
11 | 5905557071a422 |
12 | 1a663679467932 |
13 | 8820555c80b64 |
14 | 378c7a7362d5c |
15 | 18387d517db32 |
hex | b6cf72e89a76 |
201002102332022 has 4 divisors (see below), whose sum is σ = 301503153498036. Its totient is φ = 100501051166010.
The previous prime is 201002102331991. The next prime is 201002102332027. The reversal of 201002102332022 is 220233201200102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a super-3 number, since 3×2010021023320223 (a number of 44 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201002102331985 and 201002102332003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201002102332027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50250525583004 + ... + 50250525583007.
It is an arithmetic number, because the mean of its divisors is an integer number (75375788374509).
Almost surely, 2201002102332022 is an apocalyptic number.
201002102332022 is a deficient number, since it is larger than the sum of its proper divisors (100501051166014).
201002102332022 is a wasteful number, since it uses less digits than its factorization.
201002102332022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100501051166013.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 201002102332022 its reverse (220233201200102), we get a palindrome (421235303532124).
The spelling of 201002102332022 in words is "two hundred one trillion, two billion, one hundred two million, three hundred thirty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •