Base | Representation |
---|---|
bin | 1100011001000101101010… |
… | …0101011000100000010100 |
3 | 1210020112220112211101212210 |
4 | 3012101122211120200110 |
5 | 3241213304414341202 |
6 | 44551151003313420 |
7 | 2604246032130414 |
oct | 306213245304024 |
9 | 53215815741783 |
10 | 13625156012052 |
11 | 438343a3a84a2 |
12 | 164079121b870 |
13 | 77ab01274650 |
14 | 351665264644 |
15 | 18964cc42c6c |
hex | c645a958814 |
13625156012052 has 48 divisors (see below), whose sum is σ = 34238035979840. Its totient is φ = 4192298823168.
The previous prime is 13625156012033. The next prime is 13625156012077. The reversal of 13625156012052 is 25021065152631.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 13625156012052.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 11767788 + ... + 12873660.
Almost surely, 213625156012052 is an apocalyptic number.
13625156012052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13625156012052 is an abundant number, since it is smaller than the sum of its proper divisors (20612879967788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13625156012052 is a wasteful number, since it uses less digits than its factorization.
13625156012052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1184872 (or 1184870 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 39.
The spelling of 13625156012052 in words is "thirteen trillion, six hundred twenty-five billion, one hundred fifty-six million, twelve thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •