Base | Representation |
---|---|
bin | 10001111010101100110… |
… | …101110100001011000000 |
3 | 11100201002122201202022101 |
4 | 101322230311310023000 |
5 | 130133110132411021 |
6 | 2341344440120144 |
7 | 154645532005624 |
oct | 21725465641300 |
9 | 4321078652271 |
10 | 1231260435136 |
11 | 4351a1464756 |
12 | 17a762766054 |
13 | 8c151b442c4 |
14 | 43844115184 |
15 | 220642dba91 |
hex | 11eacd742c0 |
1231260435136 has 28 divisors (see below), whose sum is σ = 2527533547920. Its totient is φ = 594401588480.
The previous prime is 1231260435113. The next prime is 1231260435137. The reversal of 1231260435136 is 6315340621321.
It is a junction number, because it is equal to n+sod(n) for n = 1231260435095 and 1231260435104.
It is not an unprimeable number, because it can be changed into a prime (1231260435137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 331695460 + ... + 331699171.
Almost surely, 21231260435136 is an apocalyptic number.
1231260435136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1231260435136 is an abundant number, since it is smaller than the sum of its proper divisors (1296273112784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1231260435136 is an equidigital number, since it uses as much as digits as its factorization.
1231260435136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 663394672 (or 663394662 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 37.
The spelling of 1231260435136 in words is "one trillion, two hundred thirty-one billion, two hundred sixty million, four hundred thirty-five thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •