Base | Representation |
---|---|
bin | 1010000000010111001001… |
… | …1111101000101111101000 |
3 | 1102221201100202022110021011 |
4 | 2200011302133220233220 |
5 | 2420221212012003112 |
6 | 35221535303553304 |
7 | 2213551160200402 |
oct | 240056237505750 |
9 | 42851322273234 |
10 | 11001332141032 |
11 | 356170320a212 |
12 | 129816ba5b834 |
13 | 61a56240369c |
14 | 2a0678461b72 |
15 | 1412835e7aa7 |
hex | a01727e8be8 |
11001332141032 has 8 divisors (see below), whose sum is σ = 20627497764450. Its totient is φ = 5500666070512.
The previous prime is 11001332141017. The next prime is 11001332141047. The reversal of 11001332141032 is 23014123310011.
It is an interprime number because it is at equal distance from previous prime (11001332141017) and next prime (11001332141047).
It can be written as a sum of positive squares in only one way, i.e., 10786271788516 + 215060352516 = 3284246^2 + 463746^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 11001332140994 and 11001332141012.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 687583258807 + ... + 687583258822.
Almost surely, 211001332141032 is an apocalyptic number.
It is an amenable number.
11001332141032 is a deficient number, since it is larger than the sum of its proper divisors (9626165623418).
11001332141032 is a wasteful number, since it uses less digits than its factorization.
11001332141032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1375166517635 (or 1375166517631 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11001332141032 its reverse (23014123310011), we get a palindrome (34015455451043).
The spelling of 11001332141032 in words is "eleven trillion, one billion, three hundred thirty-two million, one hundred forty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •