Base | Representation |
---|---|
bin | 1011001001001010011111… |
… | …0001101001000101110110 |
3 | 1121101021201020022212112020 |
4 | 2302102213301221011312 |
5 | 3101214210223133010 |
6 | 42020304103334010 |
7 | 2403116335511106 |
oct | 262224761510566 |
9 | 47337636285466 |
10 | 12252061536630 |
11 | 39a4085366033 |
12 | 145a646751306 |
13 | 6ab4978c0326 |
14 | 305008107206 |
15 | 163a86c05470 |
hex | b24a7c69176 |
12252061536630 has 16 divisors (see below), whose sum is σ = 29404947687984. Its totient is φ = 3267216409760.
The previous prime is 12252061536613. The next prime is 12252061536643. The reversal of 12252061536630 is 3663516025221.
It is a happy number.
12252061536630 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×122520615366302 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 204201025581 + ... + 204201025640.
It is an arithmetic number, because the mean of its divisors is an integer number (1837809230499).
Almost surely, 212252061536630 is an apocalyptic number.
12252061536630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12252061536630 is an abundant number, since it is smaller than the sum of its proper divisors (17152886151354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12252061536630 is a wasteful number, since it uses less digits than its factorization.
12252061536630 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 408402051231.
The product of its (nonzero) digits is 388800, while the sum is 42.
The spelling of 12252061536630 in words is "twelve trillion, two hundred fifty-two billion, sixty-one million, five hundred thirty-six thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •