Base | Representation |
---|---|
bin | 10101010011101000… |
… | …10000011000100010 |
3 | 1002112012110112021120 |
4 | 22221310100120202 |
5 | 141411334421230 |
6 | 5131025033110 |
7 | 553316514522 |
oct | 125164203042 |
9 | 32465415246 |
10 | 11438982690 |
11 | 494000a003 |
12 | 2272a85796 |
13 | 1103b67715 |
14 | 7a7301682 |
15 | 46e3a3310 |
hex | 2a9d10622 |
11438982690 has 16 divisors (see below), whose sum is σ = 27453558528. Its totient is φ = 3050395376.
The previous prime is 11438982617. The next prime is 11438982697. The reversal of 11438982690 is 9628983411.
It is a super-2 number, since 2×114389826902 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (11438982697) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 190649682 + ... + 190649741.
It is an arithmetic number, because the mean of its divisors is an integer number (1715847408).
Almost surely, 211438982690 is an apocalyptic number.
11438982690 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11438982690 is an abundant number, since it is smaller than the sum of its proper divisors (16014575838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11438982690 is a wasteful number, since it uses less digits than its factorization.
11438982690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 381299433.
The product of its (nonzero) digits is 746496, while the sum is 51.
The spelling of 11438982690 in words is "eleven billion, four hundred thirty-eight million, nine hundred eighty-two thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •