Base | Representation |
---|---|
bin | 101101111011111101001111… |
… | …101001110111100100010001 |
3 | 222111100002200120021221121112 |
4 | 231323331033221313210101 |
5 | 202440044124032341423 |
6 | 1553404205252103105 |
7 | 60361231544016500 |
oct | 5573751751674421 |
9 | 874302616257545 |
10 | 202032303012113 |
11 | 59412467096262 |
12 | 1a7ab269604a95 |
13 | 88967450764b2 |
14 | 37c65b6732837 |
15 | 18554cce5ea78 |
hex | b7bf4fa77911 |
202032303012113 has 12 divisors (see below), whose sum is σ = 235017530792100. Its totient is φ = 173170278715392.
The previous prime is 202032303012091. The next prime is 202032303012131. The reversal of 202032303012113 is 311210303230202.
It can be written as a sum of positive squares in 2 ways, for example, as 122041334861824 + 79990968150289 = 11047232^2 + 8943767^2 .
It is not a de Polignac number, because 202032303012113 - 230 = 202031229270289 is a prime.
It is not an unprimeable number, because it can be changed into a prime (202032303012013) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 33163313 + ... + 38779761.
It is an arithmetic number, because the mean of its divisors is an integer number (19584794232675).
Almost surely, 2202032303012113 is an apocalyptic number.
It is an amenable number.
202032303012113 is a deficient number, since it is larger than the sum of its proper divisors (32985227779987).
202032303012113 is an equidigital number, since it uses as much as digits as its factorization.
202032303012113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6350576 (or 6350569 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 202032303012113 its reverse (311210303230202), we get a palindrome (513242606242315).
The spelling of 202032303012113 in words is "two hundred two trillion, thirty-two billion, three hundred three million, twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •