Base | Representation |
---|---|
bin | 11111011001000000011… |
… | …111110100110010011101 |
3 | 21122012222212221220202002 |
4 | 133121000133310302131 |
5 | 240320323322321401 |
6 | 4330552244212045 |
7 | 311564220430361 |
oct | 37310037646235 |
9 | 7565885856662 |
10 | 2157155667101 |
11 | 7619321565a6 |
12 | 2aa0a309a025 |
13 | 12855a450c76 |
14 | 7659a71d2a1 |
15 | 3b1a4dc4a6b |
hex | 1f6407f4c9d |
2157155667101 has 8 divisors (see below), whose sum is σ = 2170162034880. Its totient is φ = 2144150362368.
The previous prime is 2157155667097. The next prime is 2157155667103. The reversal of 2157155667101 is 1017665517512.
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 2157155667101 - 22 = 2157155667097 is a prime.
It is a super-4 number, since 4×21571556671014 (a number of 50 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2157155667103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4011770 + ... + 4517588.
It is an arithmetic number, because the mean of its divisors is an integer number (271270254360).
Almost surely, 22157155667101 is an apocalyptic number.
It is an amenable number.
2157155667101 is a deficient number, since it is larger than the sum of its proper divisors (13006367779).
2157155667101 is a wasteful number, since it uses less digits than its factorization.
2157155667101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 531523.
The product of its (nonzero) digits is 441000, while the sum is 47.
The spelling of 2157155667101 in words is "two trillion, one hundred fifty-seven billion, one hundred fifty-five million, six hundred sixty-seven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •