Base | Representation |
---|---|
bin | 1011000110001110100001… |
… | …1001101000110110001001 |
3 | 1121012110110220121221122102 |
4 | 2301203220121220312021 |
5 | 3044402342133440112 |
6 | 41541201313403145 |
7 | 2366352114035042 |
oct | 261435031506611 |
9 | 47173426557572 |
10 | 12201606155657 |
11 | 3984743641576 |
12 | 14509052694b5 |
13 | 6a67b66bb609 |
14 | 3027bd1178c9 |
15 | 1625d23acbc2 |
hex | b18e8668d89 |
12201606155657 has 8 divisors (see below), whose sum is σ = 12431953747584. Its totient is φ = 11971263327088.
The previous prime is 12201606155573. The next prime is 12201606155659. The reversal of 12201606155657 is 75655160610221.
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 12201606155657 - 238 = 11926728248713 is a prime.
It is a super-3 number, since 3×122016061556573 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12201606155659) 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, 4209638 + ... + 6490320.
It is an arithmetic number, because the mean of its divisors is an integer number (1553994218448).
Almost surely, 212201606155657 is an apocalyptic number.
It is an amenable number.
12201606155657 is a deficient number, since it is larger than the sum of its proper divisors (230347591927).
12201606155657 is a wasteful number, since it uses less digits than its factorization.
12201606155657 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2381679.
The product of its (nonzero) digits is 756000, while the sum is 47.
Adding to 12201606155657 its reverse (75655160610221), we get a palindrome (87856766765878).
The spelling of 12201606155657 in words is "twelve trillion, two hundred one billion, six hundred six million, one hundred fifty-five thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •