Base | Representation |
---|---|
bin | 1100001010101101011001… |
… | …1100010111011110011000 |
3 | 1202100221021121010111202211 |
4 | 3002223112130113132120 |
5 | 3223141400213421102 |
6 | 44241454243204504 |
7 | 2550352301033020 |
oct | 302532634273630 |
9 | 52327247114684 |
10 | 13378125920152 |
11 | 42986a4351154 |
12 | 160092b376734 |
13 | 760723592236 |
14 | 34370d064a80 |
15 | 182ee0a267d7 |
hex | c2ad6717798 |
13378125920152 has 32 divisors (see below), whose sum is σ = 28737504208800. Its totient is φ = 5719464232704.
The previous prime is 13378125920119. The next prime is 13378125920167. The reversal of 13378125920152 is 25102952187331.
It is a super-3 number, since 3×133781259201523 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13378125920096 and 13378125920105.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 292024903 + ... + 292070710.
It is an arithmetic number, because the mean of its divisors is an integer number (898047006525).
Almost surely, 213378125920152 is an apocalyptic number.
It is an amenable number.
13378125920152 is an abundant number, since it is smaller than the sum of its proper divisors (15359378288648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13378125920152 is a wasteful number, since it uses less digits than its factorization.
13378125920152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 584096035 (or 584096031 counting only the distinct ones).
The product of its (nonzero) digits is 907200, while the sum is 49.
The spelling of 13378125920152 in words is "thirteen trillion, three hundred seventy-eight billion, one hundred twenty-five million, nine hundred twenty thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •