Base | Representation |
---|---|
bin | 10100100010010111… |
… | …11110100010010110 |
3 | 1001110101221011220210 |
4 | 22101023332202112 |
5 | 140040044130041 |
6 | 5022024310250 |
7 | 540141334632 |
oct | 122113764226 |
9 | 31411834823 |
10 | 11025770646 |
11 | 474883a750 |
12 | 2178612386 |
13 | 106937b557 |
14 | 76849bdc2 |
15 | 447e80016 |
hex | 2912fe896 |
11025770646 has 32 divisors (see below), whose sum is σ = 24294422016. Its totient is φ = 3308060000.
The previous prime is 11025770633. The next prime is 11025770669. The reversal of 11025770646 is 64607752011.
11025770646 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×110257706463 (a number of 31 digits) contains 333 as substring.
It is a Curzon number.
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, 820350 + ... + 833681.
It is an arithmetic number, because the mean of its divisors is an integer number (759200688).
Almost surely, 211025770646 is an apocalyptic number.
11025770646 is an abundant number, since it is smaller than the sum of its proper divisors (13268651370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11025770646 is a wasteful number, since it uses less digits than its factorization.
11025770646 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1654148.
The product of its (nonzero) digits is 70560, while the sum is 39.
The spelling of 11025770646 in words is "eleven billion, twenty-five million, seven hundred seventy thousand, six hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •