Base | Representation |
---|---|
bin | 1011000110101111111000… |
… | …1011100100011101111111 |
3 | 1121020022121000200122001121 |
4 | 2301223332023210131333 |
5 | 3100024212221013210 |
6 | 41545242101451411 |
7 | 2400120045153541 |
oct | 261537613443577 |
9 | 47208530618047 |
10 | 12210561501055 |
11 | 3988519703075 |
12 | 14525a4410b67 |
13 | 6a75b2b35568 |
14 | 302dcc627691 |
15 | 1629586b86da |
hex | b1afe2e477f |
12210561501055 has 8 divisors (see below), whose sum is σ = 14652784540800. Its totient is φ = 9768375374496.
The previous prime is 12210561500993. The next prime is 12210561501059. The reversal of 12210561501055 is 55010516501221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12210561501055 - 231 = 12208414017407 is a prime.
It is a super-2 number, since 2×122105615010552 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12210561501055.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12210561501059) 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, 8495260 + ... + 9828049.
It is an arithmetic number, because the mean of its divisors is an integer number (1831598067600).
Almost surely, 212210561501055 is an apocalyptic number.
12210561501055 is a deficient number, since it is larger than the sum of its proper divisors (2442223039745).
12210561501055 is a wasteful number, since it uses less digits than its factorization.
12210561501055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18456593.
The product of its (nonzero) digits is 15000, while the sum is 34.
The spelling of 12210561501055 in words is "twelve trillion, two hundred ten billion, five hundred sixty-one million, five hundred one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •