Base | Representation |
---|---|
bin | 101011101111101000000… |
… | …0100101000001001100000 |
3 | 210021202102002010122121210 |
4 | 1113133100010220021200 |
5 | 1242000340412333211 |
6 | 20441535454150120 |
7 | 1160235453560502 |
oct | 127372004501140 |
9 | 23252362118553 |
10 | 6012150121056 |
11 | 1a08814009212 |
12 | 811240ab2340 |
13 | 347c35636641 |
14 | 16adbd727d72 |
15 | a65ca9ad9a6 |
hex | 577d0128260 |
6012150121056 has 48 divisors (see below), whose sum is σ = 15800931543600. Its totient is φ = 2001632583168.
The previous prime is 6012150120983. The next prime is 6012150121057. The reversal of 6012150121056 is 6501210512106.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×60121501210562 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6012150121057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37692771 + ... + 37851938.
It is an arithmetic number, because the mean of its divisors is an integer number (329186073825).
Almost surely, 26012150121056 is an apocalyptic number.
It is an amenable number.
6012150121056 is an abundant number, since it is smaller than the sum of its proper divisors (9788781422544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6012150121056 is a wasteful number, since it uses less digits than its factorization.
6012150121056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75545551 (or 75545543 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 30.
The spelling of 6012150121056 in words is "six trillion, twelve billion, one hundred fifty million, one hundred twenty-one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •