Base | Representation |
---|---|
bin | 100110010111000111000… |
… | …101011110000001100100 |
3 | 100100000101011210212001012 |
4 | 212113013011132001210 |
5 | 321142321143132012 |
6 | 5335011035321352 |
7 | 361312244141240 |
oct | 46270705360144 |
9 | 10300334725035 |
10 | 2636155052132 |
11 | 926a94891158 |
12 | 366aa2bb0258 |
13 | 161785800044 |
14 | 9183a7cd420 |
15 | 4888bed8622 |
hex | 265c715e064 |
2636155052132 has 12 divisors (see below), whose sum is σ = 5272310104320. Its totient is φ = 1129780736616.
The previous prime is 2636155052099. The next prime is 2636155052183. The reversal of 2636155052132 is 2312505516362.
2636155052132 is an admirable number.
It is a super-3 number, since 3×26361550521323 (a number of 38 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2636155052132.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 47074197332 + ... + 47074197387.
It is an arithmetic number, because the mean of its divisors is an integer number (439359175360).
Almost surely, 22636155052132 is an apocalyptic number.
It is an amenable number.
2636155052132 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2636155052132 is a wasteful number, since it uses less digits than its factorization.
2636155052132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94148394730 (or 94148394728 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 41.
The spelling of 2636155052132 in words is "two trillion, six hundred thirty-six billion, one hundred fifty-five million, fifty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •