Base | Representation |
---|---|
bin | 1011000001011111100000… |
… | …0100100111111000110100 |
3 | 1120220200112002100001021201 |
4 | 2300113320010213320310 |
5 | 3042034300231003130 |
6 | 41435550040022244 |
7 | 2360442313066240 |
oct | 260277004477064 |
9 | 46820462301251 |
10 | 12120264703540 |
11 | 39531a24a5684 |
12 | 1438ba4161984 |
13 | 69bc22697066 |
14 | 2dc8a414b420 |
15 | 160421261bca |
hex | b05f8127e34 |
12120264703540 has 48 divisors (see below), whose sum is σ = 29093896347264. Its totient is φ = 4154767747200.
The previous prime is 12120264703493. The next prime is 12120264703549. The reversal of 12120264703540 is 4530746202121.
It is a self number, because there is not a number n which added to its sum of digits gives 12120264703540.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12120264703549) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7051851 + ... + 8600530.
It is an arithmetic number, because the mean of its divisors is an integer number (606122840568).
Almost surely, 212120264703540 is an apocalyptic number.
12120264703540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12120264703540 is an abundant number, since it is smaller than the sum of its proper divisors (16973631643724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12120264703540 is a wasteful number, since it uses less digits than its factorization.
12120264703540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15657928 (or 15657926 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 37.
The spelling of 12120264703540 in words is "twelve trillion, one hundred twenty billion, two hundred sixty-four million, seven hundred three thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •