Base | Representation |
---|---|
bin | 10011101010110011110… |
… | …111001010011000011110 |
3 | 11210012210221001202010020 |
4 | 103222303313022120132 |
5 | 134121123123004204 |
6 | 2512533354253010 |
7 | 166436555411520 |
oct | 23526367123036 |
9 | 4705727052106 |
10 | 1351637313054 |
11 | 481254031826 |
12 | 199b58727166 |
13 | 9a5c7135752 |
14 | 495c3523a10 |
15 | 2525c3d9bd9 |
hex | 13ab3dca61e |
1351637313054 has 64 divisors (see below), whose sum is σ = 3255699778560. Its totient is φ = 365734195200.
The previous prime is 1351637313043. The next prime is 1351637313113. The reversal of 1351637313054 is 4503137361531.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 1351637312997 and 1351637313015.
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 31 ways as a sum of consecutive naturals, for example, 6829219 + ... + 7024350.
It is an arithmetic number, because the mean of its divisors is an integer number (50870309040).
Almost surely, 21351637313054 is an apocalyptic number.
1351637313054 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
1351637313054 is an abundant number, since it is smaller than the sum of its proper divisors (1904062465506).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1351637313054 is a wasteful number, since it uses less digits than its factorization.
1351637313054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13853705.
The product of its (nonzero) digits is 340200, while the sum is 42.
The spelling of 1351637313054 in words is "one trillion, three hundred fifty-one billion, six hundred thirty-seven million, three hundred thirteen thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •