Base | Representation |
---|---|
bin | 1011101001000100001… |
… | …1011101111111010001 |
3 | 201010020111020102210200 |
4 | 2322101003131333101 |
5 | 11234101014214301 |
6 | 231514003045413 |
7 | 20310144544650 |
oct | 2722103357721 |
9 | 633214212720 |
10 | 200002101201 |
11 | 77902a76931 |
12 | 32918370869 |
13 | 15b248a66a6 |
14 | 99744ab197 |
15 | 530873bc86 |
hex | 2e910ddfd1 |
200002101201 has 36 divisors (see below), whose sum is σ = 348453772992. Its totient is φ = 108271801872.
The previous prime is 200002101179. The next prime is 200002101223. The reversal of 200002101201 is 102101200002.
It is an interprime number because it is at equal distance from previous prime (200002101179) and next prime (200002101223).
It is not a de Polignac number, because 200002101201 - 27 = 200002101073 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (200002101281) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 4374261 + ... + 4419746.
It is an arithmetic number, because the mean of its divisors is an integer number (9679271472).
Almost surely, 2200002101201 is an apocalyptic number.
200002101201 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
200002101201 is a deficient number, since it is larger than the sum of its proper divisors (148451671791).
200002101201 is a wasteful number, since it uses less digits than its factorization.
200002101201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8794058 (or 8794036 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 200002101201 its reverse (102101200002), we get a palindrome (302103301203).
The spelling of 200002101201 in words is "two hundred billion, two million, one hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •