Base | Representation |
---|---|
bin | 101101100001011110001010… |
… | …010000100101000101001010 |
3 | 222020220002201212012101202120 |
4 | 231201132022100211011022 |
5 | 202220234111321330114 |
6 | 1545452120230512110 |
7 | 60112566312410064 |
oct | 5541361220450512 |
9 | 866802655171676 |
10 | 200212220105034 |
11 | 58880586800305 |
12 | 1a556577505636 |
13 | 8793c15219027 |
14 | 3762474a5a734 |
15 | 1822ea52605a9 |
hex | b6178a42514a |
200212220105034 has 16 divisors (see below), whose sum is σ = 421499410747680. Its totient is φ = 63224911612080.
The previous prime is 200212220105033. The next prime is 200212220105267. The reversal of 200212220105034 is 430501022212002.
It is a super-3 number, since 3×2002122201050343 (a number of 44 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200212220104995 and 200212220105013.
It is not an unprimeable number, because it can be changed into a prime (200212220105033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 878123772277 + ... + 878123772504.
It is an arithmetic number, because the mean of its divisors is an integer number (26343713171730).
Almost surely, 2200212220105034 is an apocalyptic number.
200212220105034 is an abundant number, since it is smaller than the sum of its proper divisors (221287190642646).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200212220105034 is a wasteful number, since it uses less digits than its factorization.
200212220105034 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1756247544805.
The product of its (nonzero) digits is 1920, while the sum is 24.
Adding to 200212220105034 its reverse (430501022212002), we get a palindrome (630713242317036).
The spelling of 200212220105034 in words is "two hundred trillion, two hundred twelve billion, two hundred twenty million, one hundred five thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •