Base | Representation |
---|---|
bin | 10101110001100110… |
… | …11100010000111010 |
3 | 1010011201121020122110 |
4 | 22320303130100322 |
5 | 142420222134300 |
6 | 5212010233150 |
7 | 562461664602 |
oct | 127063342072 |
9 | 33151536573 |
10 | 11690427450 |
11 | 4a59a3a199 |
12 | 23231257b6 |
13 | 1143c948c0 |
14 | 7cc875c02 |
15 | 4864c0550 |
hex | 2b8cdc43a |
11690427450 has 48 divisors (see below), whose sum is σ = 31222439136. Its totient is φ = 2877643200.
The previous prime is 11690427449. The next prime is 11690427461. The reversal of 11690427450 is 5472409611.
11690427450 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 11690427399 and 11690427408.
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 23 ways as a sum of consecutive naturals, for example, 2995596 + ... + 2999495.
It is an arithmetic number, because the mean of its divisors is an integer number (650467482).
Almost surely, 211690427450 is an apocalyptic number.
11690427450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11690427450 is an abundant number, since it is smaller than the sum of its proper divisors (19532011686).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11690427450 is a wasteful number, since it uses less digits than its factorization.
11690427450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5995119 (or 5995114 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 39.
The spelling of 11690427450 in words is "eleven billion, six hundred ninety million, four hundred twenty-seven thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •