Base | Representation |
---|---|
bin | 1011101001010010110… |
… | …0000011011110000101 |
3 | 201010101201222002012100 |
4 | 2322110230003132011 |
5 | 11234212121302013 |
6 | 231524021542313 |
7 | 20311515024531 |
oct | 2722454033605 |
9 | 633351862170 |
10 | 200063072133 |
11 | 77934430231 |
12 | 32934874999 |
13 | 15b34403572 |
14 | 997c61cbc1 |
15 | 530dc82473 |
hex | 2e94b03785 |
200063072133 has 6 divisors (see below), whose sum is σ = 288979993094. Its totient is φ = 133375381416.
The previous prime is 200063072107. The next prime is 200063072137. The reversal of 200063072133 is 331270360002.
200063072133 is a `hidden beast` number, since 2 + 0 + 0 + 0 + 630 + 7 + 21 + 3 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 196680719169 + 3382352964 = 443487^2 + 58158^2 .
It is not a de Polignac number, because 200063072133 - 25 = 200063072101 is a prime.
It is a super-2 number, since 2×2000630721332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200063072097 and 200063072106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200063072137) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11114615110 + ... + 11114615127.
Almost surely, 2200063072133 is an apocalyptic number.
It is an amenable number.
200063072133 is a deficient number, since it is larger than the sum of its proper divisors (88916920961).
200063072133 is a wasteful number, since it uses less digits than its factorization.
200063072133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22229230243 (or 22229230240 counting only the distinct ones).
The product of its (nonzero) digits is 4536, while the sum is 27.
The spelling of 200063072133 in words is "two hundred billion, sixty-three million, seventy-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •