Base | Representation |
---|---|
bin | 1010011010100100001010… |
… | …0111000100111000011100 |
3 | 1111112202022202012221120210 |
4 | 2212221002213010320130 |
5 | 3000110133042213004 |
6 | 40204425135012420 |
7 | 2261225565636300 |
oct | 246510247047034 |
9 | 44482282187523 |
10 | 11451500351004 |
11 | 371561045426a |
12 | 134b46436a110 |
13 | 650b445b806c |
14 | 2b838141dd00 |
15 | 14cd2e511089 |
hex | a6a429c4e1c |
11451500351004 has 36 divisors (see below), whose sum is σ = 31082643811464. Its totient is φ = 3271857242976.
The previous prime is 11451500350967. The next prime is 11451500351017. The reversal of 11451500351004 is 40015300515411.
It is a super-2 number, since 2×114515003510042 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 9737669779 + ... + 9737670954.
Almost surely, 211451500351004 is an apocalyptic number.
11451500351004 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
11451500351004 is an abundant number, since it is smaller than the sum of its proper divisors (19631143460460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11451500351004 is a wasteful number, since it uses less digits than its factorization.
11451500351004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19475340754 (or 19475340745 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 30.
Adding to 11451500351004 its reverse (40015300515411), we get a palindrome (51466800866415).
The spelling of 11451500351004 in words is "eleven trillion, four hundred fifty-one billion, five hundred million, three hundred fifty-one thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •