Base | Representation |
---|---|
bin | 110010001001011110001011… |
… | …110111001001000101011011 |
3 | 1001220220200101120021021212021 |
4 | 302021132023313021011123 |
5 | 212402020434244330201 |
6 | 2101024425154555311 |
7 | 64312305125546440 |
oct | 6211361367110533 |
9 | 1056820346237767 |
10 | 220553212105051 |
11 | 64303101471a01 |
12 | 208a0834598b37 |
13 | 960b103a79977 |
14 | 3c66b922519c7 |
15 | 1a771663dcea1 |
hex | c8978bdc915b |
220553212105051 has 8 divisors (see below), whose sum is σ = 252062715534080. Its totient is φ = 189044184100968.
The previous prime is 220553212105021. The next prime is 220553212105157. The reversal of 220553212105051 is 150501212355022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220553212105051 - 215 = 220553212072283 is a prime.
It is a super-2 number, since 2×2205532121050512 (a number of 29 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 = 220553212104998 and 220553212105016.
It is not an unprimeable number, because it can be changed into a prime (220553212105001) 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, 117861591 + ... + 119718256.
It is an arithmetic number, because the mean of its divisors is an integer number (31507839441760).
Almost surely, 2220553212105051 is an apocalyptic number.
220553212105051 is a deficient number, since it is larger than the sum of its proper divisors (31509503429029).
220553212105051 is a wasteful number, since it uses less digits than its factorization.
220553212105051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237712473.
The product of its (nonzero) digits is 30000, while the sum is 34.
The spelling of 220553212105051 in words is "two hundred twenty trillion, five hundred fifty-three billion, two hundred twelve million, one hundred five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •