Base | Representation |
---|---|
bin | 100011011001011001001100… |
… | …111110010001000011010001 |
3 | 202102012112201012212110021221 |
4 | 203121121030332101003101 |
5 | 130401101313024031001 |
6 | 1311032513323445041 |
7 | 44535161104503100 |
oct | 4331311476210321 |
9 | 672175635773257 |
10 | 155676676002001 |
11 | 45670120136510 |
12 | 15563223986781 |
13 | 68b332ab5a05b |
14 | 2a62b1155a037 |
15 | 12ee7932491a1 |
hex | 8d964cf910d1 |
155676676002001 has 24 divisors (see below), whose sum is σ = 197689157905536. Its totient is φ = 121224922146720.
The previous prime is 155676676001981. The next prime is 155676676002017. The reversal of 155676676002001 is 100200676676551.
It is not a de Polignac number, because 155676676002001 - 213 = 155676675993809 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 155676676002001.
It is not an unprimeable number, because it can be changed into a prime (155676676003001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 96315186 + ... + 97918171.
It is an arithmetic number, because the mean of its divisors is an integer number (8237048246064).
Almost surely, 2155676676002001 is an apocalyptic number.
155676676002001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
155676676002001 is a deficient number, since it is larger than the sum of its proper divisors (42012481903535).
155676676002001 is a wasteful number, since it uses less digits than its factorization.
155676676002001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 194234869 (or 194234862 counting only the distinct ones).
The product of its (nonzero) digits is 3175200, while the sum is 52.
The spelling of 155676676002001 in words is "one hundred fifty-five trillion, six hundred seventy-six billion, six hundred seventy-six million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •