Base | Representation |
---|---|
bin | 11110101101000011110101… |
… | …001001100001000101011010 |
3 | 122201010111101100212112011220 |
4 | 132231003311021201011122 |
5 | 120144430041440331340 |
6 | 1155111314155032510 |
7 | 40305110445122211 |
oct | 3655036511410532 |
9 | 581114340775156 |
10 | 135037884698970 |
11 | 3a033277533860 |
12 | 1318b2b643b736 |
13 | 5a470303b4496 |
14 | 254bc23202078 |
15 | 10929a2c15ed0 |
hex | 7ad0f526115a |
135037884698970 has 128 divisors (see below), whose sum is σ = 353861238601728. Its totient is φ = 32707996819200.
The previous prime is 135037884698953. The next prime is 135037884698987. The reversal of 135037884698970 is 79896488730531.
It is an interprime number because it is at equal distance from previous prime (135037884698953) and next prime (135037884698987).
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 63 ways as a sum of consecutive naturals, for example, 1836638629 + ... + 1836712151.
It is an arithmetic number, because the mean of its divisors is an integer number (2764540926576).
Almost surely, 2135037884698970 is an apocalyptic number.
135037884698970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
135037884698970 is an abundant number, since it is smaller than the sum of its proper divisors (218823353902758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135037884698970 is a wasteful number, since it uses less digits than its factorization.
135037884698970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78308.
The product of its (nonzero) digits is 2194698240, while the sum is 78.
The spelling of 135037884698970 in words is "one hundred thirty-five trillion, thirty-seven billion, eight hundred eighty-four million, six hundred ninety-eight thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •