Base | Representation |
---|---|
bin | 101101110001110001001000… |
… | …010011101111110000100010 |
3 | 222101212011100012222201011202 |
4 | 231301301020103233300202 |
5 | 202342111120111300302 |
6 | 1552110405005441202 |
7 | 60256523061342005 |
oct | 5561611023576042 |
9 | 871764305881152 |
10 | 201332100103202 |
11 | 59172511878152 |
12 | 1a6b7614b70202 |
13 | 88456c6874213 |
14 | 37a07504cd53c |
15 | 184219b176202 |
hex | b71c484efc22 |
201332100103202 has 8 divisors (see below), whose sum is σ = 302019676902300. Its totient is φ = 100658874469104.
The previous prime is 201332100103193. The next prime is 201332100103223. The reversal of 201332100103202 is 202301001233102.
It can be written as a sum of positive squares in 2 ways, for example, as 199471246718041 + 1860853385161 = 14123429^2 + 1364131^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2013321001032022 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3587756177 + ... + 3587812292.
Almost surely, 2201332100103202 is an apocalyptic number.
201332100103202 is a deficient number, since it is larger than the sum of its proper divisors (100687576799098).
201332100103202 is a wasteful number, since it uses less digits than its factorization.
201332100103202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7175582500.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 201332100103202 its reverse (202301001233102), we get a palindrome (403633101336304).
The spelling of 201332100103202 in words is "two hundred one trillion, three hundred thirty-two billion, one hundred million, one hundred three thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •