Base | Representation |
---|---|
bin | 1011101001000110100… |
… | …1101100000000111001 |
3 | 201010021012002110011210 |
4 | 2322101221230000321 |
5 | 11234111100320441 |
6 | 231515001513333 |
7 | 20310325653432 |
oct | 2722151540071 |
9 | 633235073153 |
10 | 200012120121 |
11 | 7790869a230 |
12 | 3291b7a2849 |
13 | 15b269a3a48 |
14 | 9975958489 |
15 | 530956a616 |
hex | 2e91a6c039 |
200012120121 has 32 divisors (see below), whose sum is σ = 294065510400. Its totient is φ = 119913752000.
The previous prime is 200012120083. The next prime is 200012120137. The reversal of 200012120121 is 121021210002.
It is a cyclic number.
It is not a de Polignac number, because 200012120121 - 211 = 200012118073 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200012120097 and 200012120106.
It is not an unprimeable number, because it can be changed into a prime (200012120141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3850480 + ... + 3902078.
It is an arithmetic number, because the mean of its divisors is an integer number (9189547200).
Almost surely, 2200012120121 is an apocalyptic number.
It is an amenable number.
200012120121 is a deficient number, since it is larger than the sum of its proper divisors (94053390279).
200012120121 is a wasteful number, since it uses less digits than its factorization.
200012120121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52877.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 200012120121 its reverse (121021210002), we get a palindrome (321033330123).
It can be divided in two parts, 2000 and 12120121, that added together give a palindrome (12122121).
The spelling of 200012120121 in words is "two hundred billion, twelve million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •