Base | Representation |
---|---|
bin | 101101100001101110110001… |
… | …110110001110101111010010 |
3 | 222020221210210102221002101100 |
4 | 231201232301312032233102 |
5 | 202221032132410434402 |
6 | 1545504231022445230 |
7 | 60114100435343115 |
oct | 5541566166165722 |
9 | 866853712832340 |
10 | 200230064155602 |
11 | 58888103257638 |
12 | 1a559b17433816 |
13 | 87957ca046730 |
14 | 376328889057c |
15 | 182369bab171c |
hex | b61bb1d8ebd2 |
200230064155602 has 24 divisors (see below), whose sum is σ = 467203483030284. Its totient is φ = 61609250509344.
The previous prime is 200230064155573. The next prime is 200230064155603. The reversal of 200230064155602 is 206551460032002.
200230064155602 is a `hidden beast` number, since 2 + 0 + 0 + 2 + 3 + 0 + 0 + 6 + 41 + 5 + 5 + 602 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 141889049534961 + 58341014620641 = 11911719^2 + 7638129^2 .
It is a super-2 number, since 2×2002300641556022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (200230064155603) 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, 427842017193 + ... + 427842017660.
Almost surely, 2200230064155602 is an apocalyptic number.
200230064155602 is an abundant number, since it is smaller than the sum of its proper divisors (266973418874682).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200230064155602 is a wasteful number, since it uses less digits than its factorization.
200230064155602 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 855684034874 (or 855684034871 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The spelling of 200230064155602 in words is "two hundred trillion, two hundred thirty billion, sixty-four million, one hundred fifty-five thousand, six hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •