Base | Representation |
---|---|
bin | 101100100010111001001… |
… | …0100111111001100010110 |
3 | 210200021120212220020121200 |
4 | 1121011302110333030112 |
5 | 1300301330101014032 |
6 | 21004304325453330 |
7 | 1201213655425452 |
oct | 131056224771426 |
9 | 23607525806550 |
10 | 6122246501142 |
11 | 1a504805a8092 |
12 | 82a647b71246 |
13 | 35542caaa485 |
14 | 172465639662 |
15 | a93c129347c |
hex | 5917253f316 |
6122246501142 has 48 divisors (see below), whose sum is σ = 14046486070032. Its totient is φ = 1920522585600.
The previous prime is 6122246501027. The next prime is 6122246501143. The reversal of 6122246501142 is 2411056422216.
6122246501142 is a `hidden beast` number, since 6 + 1 + 2 + 2 + 2 + 4 + 6 + 501 + 142 = 666.
It is a super-2 number, since 2×61222465011422 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 6122246501097 and 6122246501106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6122246501143) 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, 2300253 + ... + 4187559.
It is an arithmetic number, because the mean of its divisors is an integer number (292635126459).
Almost surely, 26122246501142 is an apocalyptic number.
6122246501142 is an abundant number, since it is smaller than the sum of its proper divisors (7924239568890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6122246501142 is a wasteful number, since it uses less digits than its factorization.
6122246501142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1897933 (or 1897930 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 36.
The spelling of 6122246501142 in words is "six trillion, one hundred twenty-two billion, two hundred forty-six million, five hundred one thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •