Base | Representation |
---|---|
bin | 101101100001011110000011… |
… | …000110011111101100010011 |
3 | 222020220002102111020111110011 |
4 | 231201132003012133230103 |
5 | 202220233340101133021 |
6 | 1545452100301015351 |
7 | 60112563323615641 |
oct | 5541360306375423 |
9 | 866802374214404 |
10 | 200212100021011 |
11 | 58880524a41411 |
12 | 1a556543254557 |
13 | 8793bc6392ab0 |
14 | 3762462b1c191 |
15 | 1822e9993ede1 |
hex | b6178319fb13 |
200212100021011 has 16 divisors (see below), whose sum is σ = 224999272270080. Its totient is φ = 176766659546400.
The previous prime is 200212100020981. The next prime is 200212100021029. The reversal of 200212100021011 is 110120001212002.
It is not a de Polignac number, because 200212100021011 - 25 = 200212100020979 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200212100020982 and 200212100021000.
It is not an unprimeable number, because it can be changed into a prime (200212100021071) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11770665 + ... + 23215786.
It is an arithmetic number, because the mean of its divisors is an integer number (14062454516880).
Almost surely, 2200212100021011 is an apocalyptic number.
200212100021011 is a deficient number, since it is larger than the sum of its proper divisors (24787172249069).
200212100021011 is a wasteful number, since it uses less digits than its factorization.
200212100021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35005626.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200212100021011 its reverse (110120001212002), we get a palindrome (310332101233013).
The spelling of 200212100021011 in words is "two hundred trillion, two hundred twelve billion, one hundred million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •