Base | Representation |
---|---|
bin | 1011001001101010000011… |
… | …1101100110001111010000 |
3 | 1121102002120220201101112220 |
4 | 2302122200331212033100 |
5 | 3101334040003233002 |
6 | 42024225113421040 |
7 | 2403536353250142 |
oct | 262324075461720 |
9 | 47362526641486 |
10 | 12260537164752 |
11 | 39a7734663978 |
12 | 146021110a780 |
13 | 6ac2188341b6 |
14 | 3055ada20c92 |
15 | 163dd0d527bc |
hex | b26a0f663d0 |
12260537164752 has 20 divisors (see below), whose sum is σ = 31673054342400. Its totient is φ = 4086845721568.
The previous prime is 12260537164751. The next prime is 12260537164793. The reversal of 12260537164752 is 25746173506221.
It is a junction number, because it is equal to n+sod(n) for n = 12260537164695 and 12260537164704.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12260537164751) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 127713928752 + ... + 127713928847.
It is an arithmetic number, because the mean of its divisors is an integer number (1583652717120).
Almost surely, 212260537164752 is an apocalyptic number.
12260537164752 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12260537164752 is an abundant number, since it is smaller than the sum of its proper divisors (19412517177648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12260537164752 is a wasteful number, since it uses less digits than its factorization.
12260537164752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255427857610 (or 255427857604 counting only the distinct ones).
The product of its (nonzero) digits is 4233600, while the sum is 51.
The spelling of 12260537164752 in words is "twelve trillion, two hundred sixty billion, five hundred thirty-seven million, one hundred sixty-four thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •