Base | Representation |
---|---|
bin | 1011000110001110010000… |
… | …1000011101101100000001 |
3 | 1121012110021220212201210120 |
4 | 2301203210020131230001 |
5 | 3044402220320412031 |
6 | 41541150234450453 |
7 | 2366350254251421 |
oct | 261434410355401 |
9 | 47173256781716 |
10 | 12201534544641 |
11 | 3984707180112 |
12 | 14508a5293a29 |
13 | 6a67a4907730 |
14 | 3027b37d6481 |
15 | 1625cae64a96 |
hex | b18e421db01 |
12201534544641 has 8 divisors (see below), whose sum is σ = 17520152166720. Its totient is φ = 7508636642832.
The previous prime is 12201534544627. The next prime is 12201534544649. The reversal of 12201534544641 is 14644543510221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12201534544641 - 210 = 12201534543617 is a prime.
It is a super-3 number, since 3×122015345446413 (a number of 40 digits) contains 333 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12201534544593 and 12201534544602.
It is not an unprimeable number, because it can be changed into a prime (12201534544649) 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, 156429930021 + ... + 156429930098.
It is an arithmetic number, because the mean of its divisors is an integer number (2190019020840).
Almost surely, 212201534544641 is an apocalyptic number.
It is an amenable number.
12201534544641 is a deficient number, since it is larger than the sum of its proper divisors (5318617622079).
12201534544641 is a wasteful number, since it uses less digits than its factorization.
12201534544641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 312859860135.
The product of its (nonzero) digits is 460800, while the sum is 42.
The spelling of 12201534544641 in words is "twelve trillion, two hundred one billion, five hundred thirty-four million, five hundred forty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •