Base | Representation |
---|---|
bin | 10000100010011001100… |
… | …011010001011101010100 |
3 | 11000122100222111222001112 |
4 | 100202121203101131110 |
5 | 122104421031323430 |
6 | 2230024330314152 |
7 | 145051141410311 |
oct | 20423143213524 |
9 | 4018328458045 |
10 | 1136447526740 |
11 | 3a8a68002319 |
12 | 164301b88958 |
13 | 83221b7b146 |
14 | 3d00bd37d08 |
15 | 1e865663195 |
hex | 108998d1754 |
1136447526740 has 48 divisors (see below), whose sum is σ = 2451280203792. Its totient is φ = 442249906176.
The previous prime is 1136447526727. The next prime is 1136447526763. The reversal of 1136447526740 is 476257446311.
It can be written as a sum of positive squares in 8 ways, for example, as 3368177296 + 1133079349444 = 58036^2 + 1064462^2 .
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 8112734 + ... + 8251626.
It is an arithmetic number, because the mean of its divisors is an integer number (51068337579).
Almost surely, 21136447526740 is an apocalyptic number.
1136447526740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1136447526740 is an abundant number, since it is smaller than the sum of its proper divisors (1314832677052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1136447526740 is a wasteful number, since it uses less digits than its factorization.
1136447526740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149996 (or 149994 counting only the distinct ones).
The product of its (nonzero) digits is 3386880, while the sum is 50.
The spelling of 1136447526740 in words is "one trillion, one hundred thirty-six billion, four hundred forty-seven million, five hundred twenty-six thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.074 sec. • engine limits •