Base | Representation |
---|---|
bin | 1011101010000010100… |
… | …1001100111100111100 |
3 | 201010220201101112212011 |
4 | 2322200221030330330 |
5 | 11240114443314012 |
6 | 231555545021004 |
7 | 20316501643126 |
oct | 2724051147474 |
9 | 633821345764 |
10 | 200263651132 |
11 | 77a276791a6 |
12 | 3298ba84764 |
13 | 15b66b3126c |
14 | 999b112216 |
15 | 53216a31a7 |
hex | 2ea0a4cf3c |
200263651132 has 6 divisors (see below), whose sum is σ = 350461389488. Its totient is φ = 100131825564.
The previous prime is 200263651123. The next prime is 200263651163. The reversal of 200263651132 is 231156362002.
It is a happy number.
200263651132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 200263651094 and 200263651103.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25032956388 + ... + 25032956395.
Almost surely, 2200263651132 is an apocalyptic number.
It is an amenable number.
200263651132 is a deficient number, since it is larger than the sum of its proper divisors (150197738356).
200263651132 is a wasteful number, since it uses less digits than its factorization.
200263651132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50065912787 (or 50065912785 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 31.
The spelling of 200263651132 in words is "two hundred billion, two hundred sixty-three million, six hundred fifty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •