Base | Representation |
---|---|
bin | 1110001100000… |
… | …11011100100101 |
3 | 22021222020000200 |
4 | 13012003130211 |
5 | 220432334433 |
6 | 15451101113 |
7 | 2643500634 |
oct | 706033445 |
9 | 267866020 |
10 | 119027493 |
11 | 61208132 |
12 | 33a41799 |
13 | 1b876390 |
14 | 11b4551b |
15 | a6b2613 |
hex | 7183725 |
119027493 has 12 divisors (see below), whose sum is σ = 185154060. Its totient is φ = 73247616.
The previous prime is 119027471. The next prime is 119027543. The reversal of 119027493 is 394720911.
It can be written as a sum of positive squares in 2 ways, for example, as 20958084 + 98069409 = 4578^2 + 9903^2 .
It is not a de Polignac number, because 119027493 - 212 = 119023397 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (119023493) 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 11 ways as a sum of consecutive naturals, for example, 508548 + ... + 508781.
It is an arithmetic number, because the mean of its divisors is an integer number (15429505).
Almost surely, 2119027493 is an apocalyptic number.
119027493 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
119027493 is a deficient number, since it is larger than the sum of its proper divisors (66126567).
119027493 is a wasteful number, since it uses less digits than its factorization.
119027493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1017348 (or 1017345 counting only the distinct ones).
The product of its (nonzero) digits is 13608, while the sum is 36.
The square root of 119027493 is about 10909.9721814494. The cubic root of 119027493 is about 491.9063499127.
The spelling of 119027493 in words is "one hundred nineteen million, twenty-seven thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •