Base | Representation |
---|---|
bin | 10101011001110010… |
… | …10100111010111010 |
3 | 1002122210200011210011 |
4 | 22230321110322322 |
5 | 142013101044032 |
6 | 5140112212134 |
7 | 554514600532 |
oct | 125471247272 |
9 | 32583604704 |
10 | 11490643642 |
11 | 4967194705 |
12 | 228823a04a |
13 | 1111784b2a |
14 | 7b010c4c2 |
15 | 473baa247 |
hex | 2ace54eba |
11490643642 has 8 divisors (see below), whose sum is σ = 18143121600. Its totient is φ = 5442936444.
The previous prime is 11490643603. The next prime is 11490643657. The reversal of 11490643642 is 24634609411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 11490643595 and 11490643604.
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 3 ways as a sum of consecutive naturals, for example, 151192642 + ... + 151192717.
It is an arithmetic number, because the mean of its divisors is an integer number (2267890200).
Almost surely, 211490643642 is an apocalyptic number.
11490643642 is a deficient number, since it is larger than the sum of its proper divisors (6652477958).
11490643642 is a wasteful number, since it uses less digits than its factorization.
11490643642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302385380.
The product of its (nonzero) digits is 124416, while the sum is 40.
The spelling of 11490643642 in words is "eleven billion, four hundred ninety million, six hundred forty-three thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •