Base | Representation |
---|---|
bin | 10011000101100011000… |
… | …001101111010100100000 |
3 | 11122101112111112001212220 |
4 | 103011203001233110200 |
5 | 132442202331110012 |
6 | 2442315230151040 |
7 | 163522216444125 |
oct | 23054301572440 |
9 | 4571474461786 |
10 | 1311626425632 |
11 | 466291a17916 |
12 | 192251052480 |
13 | 968bba40733 |
14 | 476a972074c |
15 | 241b99a208c |
hex | 1316306f520 |
1311626425632 has 48 divisors (see below), whose sum is σ = 3443798917440. Its totient is φ = 437109818112.
The previous prime is 1311626425621. The next prime is 1311626425639. The reversal of 1311626425632 is 2365246261131.
It is a tau number, because it is divible by the number of its divisors (48).
It is not an unprimeable number, because it can be changed into a prime (1311626425639) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1119907 + ... + 1969122.
It is an arithmetic number, because the mean of its divisors is an integer number (71745810780).
Almost surely, 21311626425632 is an apocalyptic number.
1311626425632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1311626425632 is an abundant number, since it is smaller than the sum of its proper divisors (2132172491808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1311626425632 is a wasteful number, since it uses less digits than its factorization.
1311626425632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3093465 (or 3093457 counting only the distinct ones).
The product of its digits is 311040, while the sum is 42.
The spelling of 1311626425632 in words is "one trillion, three hundred eleven billion, six hundred twenty-six million, four hundred twenty-five thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •